Zkevm (12) state proof of appliedzkp

1. introduction

State Proof Can help EVM Proof Check all random read-write access records The effectiveness of the , By first pressing unique index Will these records grouping , Then press access order Sort . take access order be called ReadWriteCounter, Would be right access records technology , At the same time for each record Provide a unique identification . When generated state proof after , Will be generated BusMapping As lookup table Share with EVM proof.

2. Random Read-Write Data

State proof Will maintain EVM proof Of random accessible data Read and write part of .

stay state proof The operations recorded in are ：

• Memory： With byte array Method call memory.
• Stack： With RLC-encoded word array Method call stack.
• Storage： Put the... Of the account number storage As a key-value mapping.
• CallContext： by call The context of .
• Account： For account number state（nonce, balance, code hash）.
• TxRefund：refund to tx sender Amount of （value）.
• TxAccessListAccount： by account access list Of state.
• TxAccessListAccountStorage： by account storage access list Of state.
• AccountDestructed： For account destruction Of state.

Each of the above operations uses different parameters to epitomize . Specific view RW Table.

all table Of key Spliced together to form the data Unique index of . Every record With a ReadWriteCounter relation , these records First group by its unique index , Then press ReadWriteCounter Incremental sort . Known to the previous record Of access, Every target Each has its own format and update rules , Such as Memory Medium values Sure 8-bit To express .

3. Circuit Constraints

Constraints are mainly divided into two categories ：

• 1） Global constraints that affect all operations ： Such as key Alphabetical order of .
• 2） Specific constraints on each operation ： For each type of operation selector-like Express , To enable additional constraints for this operation only .

Used to guarantee proper ordering/transition of values Constraints , With the help of fixed lookup table, use range checks of the difference between the consecutive cells. As a result of lookup table To prove correct ordering, Each column must be sorted , Therefore, you need to define the maximum value it contains （ To the corresponding fixed lookup table Of size）. same table Inside 2 A continuous cell There will be a difference , Reverse sorting will result in this difference wrap around For a very large value （ because field Domain calculation ）, So that the result is not table Inside .

Reference material

[1] State Proof