Tachyon proof trees and shared evidence
Tachyon reduces the nullifier-storage burden per epoch. The post explains how a wallet reuses shared evidence, created once per epoch, to prove that a note has not been spent.
Project Tachyon published a technical post explaining how to build Tachyon's proof tree as shared evidence. A shielded spend must prove, without revealing the note, that the note was created and has not yet been spent. In Ironwood, a spend proves membership in the note commitment tree and reveals a permanent nullifier. The commitment tree can be updated with a compact state, but the nullifier set keeps growing. Validators must keep every nullifier published on-chain forever in order to reject a second spend of the same note.
Tachyon introduces epochs to shrink the nullifier set that validators must maintain. A note's nullifier changes every epoch, and validators are responsible only for a small rolling window of recent history. For the earlier span, the wallet proves that its note's earlier nullifiers did not appear in past epochs. To do this, it separates the proof of the long history, called pool state, from the proof of the detailed history, called note state, so that evidence created once per epoch is reused by many wallets. This check can be delegated to an oblivious syncing service (OSS).
Technically, Tachyon uses a root polynomial accumulator over the Pasta field. An opening result of zero proves membership and a nonzero result proves non-membership, so note commitments and nullifiers share a single structure and are published as tachygrams, which are 32-byte field elements with no role label. Stamp commitments are absorbed into a hash chain to advance the anchor, and the proof tree chains claims together with proof-carrying data (PCD). A spendable is a wallet-held proof state that vouches for note creation and nullifier absence up to a specific anchor.
To reduce query cost, quadratic residue (QR) routing divides tachygrams into bounded buckets. The builder keeps the reference value private while the epoch is in progress, then reveals it and publishes the sealed buckets when the epoch closes. For each split, the circuit checks that the product of the child polynomials equals the parent and that the siblings contain only opposite classes, guaranteeing an exact partition. The OSS picks the bucket matching the candidate value and proves non-membership with a single bounded polynomial opening, and the wallet ties that result to its own note's nullifier through an encoding using non-residues and a division relation.
On a spend, in addition to the usual value and spend-authority checks, it publishes the epoch of the spend anchor and the next epoch's nullifier. The second value is for the case where the epoch changes before inclusion. The validator checks the proof, that the anchor belongs to the accepted history, and that the published values do not conflict with the recent window it keeps. This live check covers the span from the anchor the wallet certified to the time the transaction is included. The proof-tree implementation notes lay out each step.
This summary is based on the original; check the original for exact details.