Paper 2023/1082 Original: eprint.iacr.org/2023/1082 ↗

Intmax2: A ZK-rollup with Minimal Onchain Data and Computation Costs Featuring Decentralized Aggregators

Erik Rybakken
Leona Hioki
Mario Yaksetig
Denisa Diaconescu
František Silváši
Julian Sutherland
Abstract

We present a blockchain scaling solution called Intmax2, which is a Zero-Knowledge rollup (ZK-rollup) protocol with stateless and permissionless block production, while minimizing the usage of data and computation on the underlying blockchain. Our architecture distinctly diverges from existing ZK-rollups since essentially all of the data and computational costs are shifted to the client-side as opposed to imposing heavy requirements on the block producers or the underlying Layer 1 blockchain. The only job for block producers is to periodically generate a commitment to a set of transactions, distribute inclusion proofs to each sender, and collect and aggregate signatures by the senders. This design allows permissionless and stateless block production, and is highly scalable with the number of users. We give a proof of the main security property of the protocol, which has been formally verified by the Nethermind Formal Verification Team in the Lean theorem prover.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2025-01-28: last updated
2023-07-11: published
Short URL
https://ia.cr/2023/1082
License
https://creativecommons.org/licenses/by-nc/4.0/

BibTeX

@misc{cryptoeprint:2023/1082,
      author = {Erik Rybakken and Leona Hioki and Mario Yaksetig and Denisa Diaconescu and František Silváši and Julian Sutherland},
      title = {Intmax2: A ZK-rollup with Minimal Onchain Data and Computation Costs Featuring Decentralized Aggregators},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/1082},
      year = {2023},
      url = {https://eprint.iacr.org/2023/1082}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.