Leaf Me Hard
Proof of Merkle Proof of inclusion
About
The problem it solves  Solving a problem of Merkle (Patricia) Trie (MPT) inclusion compression is important in several domains: - Optimistic Rollups might generate big Fraud Proofs, where MPT state proof is several time bigger than the data it proves - Ethereum is pushing towards [statelessness roadmap](https://ethereum.org/en/roadmap/statelessness/) - Re-execution protocols like Polkadot rely on Rollup State Proofs for stateless validation We were trying to use several ZK tools for succinctness property to compare them and contribute to the Ecosystem along the way.
How it's made
Challenges we ran into Aleo doesn't support: - generic arrays - up to 32 array elements - the documentation was poor - quirks like: extra EOF of the input file breaks compilation Noir: - Many breaking changes in the compiler that broke existing code - Missing support for some hash functions like blake2b - Our contribution here: https://github.com/noir-lang/noir/pull/8989 None of the languages supported compact multi-proofs