You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: src/content/developers/docs/scaling/zk-rollups/index.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -117,7 +117,7 @@ Before accepting transactions, the operator will perform the usual checks. This
117
117
118
118
Once the ZK-rollup node has enough transactions, it aggregates them into a batch and compiles inputs for the proving circuit to compile into a succinct ZK-proof. This includes:
119
119
120
-
- A Merkle tree comprising all the transactions in the batch.
120
+
- A Merkle tree root comprising all the transactions in the batch.
121
121
- Merkle proofs for transactions to prove inclusion in the batch.
122
122
- Merkle proofs for each sender-receiver pair in transactions to prove those accounts are part of the rollup's state tree.
123
123
- A set of intermediate state roots, derived from updating the state root after applying state updates for each transaction (i.e., decreasing sender accounts and increasing receiver accounts).
0 commit comments