Skip to content
§ · PROTOCOLS

Atomic Swap Efficiency

Reducing gas overhead by 40% via recursive SNARKs.

Cross-venue settlement used to verify every swap independently, and the verification cost dominated the path. By folding a batch of swap proofs into a single recursive SNARK, LIAW verifies the whole batch once and inherits the guarantees of each individual proof.

The win is structural, not incremental. A recursive proof carries the validity of every proof beneath it, so the on-chain verifier checks one object regardless of batch size. In production this cut settlement gas overhead by roughly 40% while leaving the freshness budget on the data path untouched — the proving happens off the hot path and stamps its result into the lineage like any other source event.

The result is the same contract we make everywhere else: a swap is not just settled, it is provable — and the proof is a first-class field in the ledger, not an afterthought bolted on at the edge.

§ · KEEP READING

The ledger is always open.

See where every price we publish came from, or head back for the rest of the posts.