Governance

Faster, Aggregatable and Quantum Safe Privacy Pools

Read full article at source ↗

Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 19/10/2026, 11:13:26 UTC.

Briefings

A post-quantum binary-field SNARK named Flock successfully ported Tornado Cash to a depth-32 withdrawal in under 30 ms using SHA-256. The implementation reduces circuit complexity from 34 compressions to one via a multiplexer, while a new recovery protocol allows existing pools to survive discrete log breaks by deriving note secrets from a seed. Benchmarks show user proofs are 28x faster at depth 32, and aggregation costs remain constant regardless of withdrawal count.

Key points

• Flock ported Tornado Cash to a depth-32 withdrawal in under 30 ms using SHA-256, reducing circuit complexity from 34 compressions to one via a multiplexer.
• A recovery protocol allows existing Tornado Cash-like pools to survive a discrete log break by deriving note secrets from a seed, ensuring notes remain spendable post-quantum.

Context

This research addresses the need for privacy pools to transition to post-quantum primitives, supported by recent progress in binary-field proving systems and leanVM aggregation. The findings provide a working implementation and benchmarks for Tornado Cash ported to Flock, offering a path for existing pools to survive future quantum attacks through a simple seed-based recovery protocol.

Limitations

Evidence covers only the Flock port and recovery protocol; performance data is limited to depth 32 and aggregation at 46 withdrawals. No quantum attack details or specific hash function vulnerabilities are reported.

Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 19/10/2026, 11:33:41 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.

View archived briefing on IPFS
bafybeifxma252sbmnak7onfoj2vos5u4tyr4u3egxl5fj5oiuznlfylwmu