Leaf Me Hard

Leaf Me Hard

Proof of Merkle Proof of inclusion

Created on 22nd June 2025

Leaf Me Hard

Leaf Me Hard

Proof of Merkle Proof of inclusion

The problem Leaf Me Hard solves

image

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
  • 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.

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:

None of the languages supported compact multi-proofs

Tracks Applied (2)

ZK Hack Berlin Winners

We proved MPT (multi-proof) inclusion in Noir and did a comparison for merkle tree inclusion with Aleo

Most Innovative or Technically Proficient Aztec Integration

We did a MPT proof for Polkadot MPT in Noir
Aztec

Aztec

Technologies used

Discussion

Builders also viewed

See more projects on Devfolio