Ideas we borrowed, and what we built with them
Some of the desk's best moves come from published research on folding schemes, coroutine-based virtual machines, and spend-once ledgers. Here's what we took, how we rebuilt it for Hedera, and what stays out of reach on this ledger today.
Fold many inputs into one commitment
Published research on lattice folding compresses many constraint systems into one proof.
A batch seal hashes many lines into one SHA-384, so one topic message covers the whole set. We borrowed the size idea; we don't run a folding scheme.
Keep private state local
Research on folding-based virtual machines keeps the witness off the chain.
Your document stays in the browser and the topic gets a hash. That's a commitment, not a zero-knowledge proof.
Spend once
UTXO-style designs consume an output instead of overwriting it.
Hedera is account-based and a seal is a log entry, so Consume writes a second message naming the sequence. Spend-once behavior without a UTXO move.
Not on Hedera (yet)
- Coroutines as a VM primitive. Hedera has no such executor.
- Effect handlers that yield into a zkVM.
- A folded zero-knowledge proof. That proving work is still experimental research and isn't on this desk.
- Cross-chain execution through a shared VM. Hedera hasn't adopted one.
Where the idea pays off today is the batch seal: many lines, one hash, one message. You get the size win without a folding scheme.
Try the batch seal