Integrating Tachyon cryptography into Zakura Common
Work has begun on bringing Tachyon's recursive proofs into the core of Zakura Common, Zcash's newest cryptographic stack. As a first step, a new crate containing mature components of the Ragu code is being released.
Project Tachyon has begun integrating Tachyon's recursive proofs into Common, the cryptographic stack of Zakura, the new Zcash full node built with Valar Group. Common is used by Zakura and several other projects and has made Ironwood zk-SNARK proofs much faster. Tachyon's recursive proofs are inherently more expensive and larger in memory and binary size, but because they reuse much of the Ironwood cryptography, the optimized codebase in Common is said to reduce that burden.
Tachyon and Ironwood both use the Pasta curve cycle, but their requirements are not identical. Tachyon partly overlaps but needs longer generator vectors, must prove on both curves of the cycle, and uses slightly different Poseidon parameters. Building these requirements into Common's arithmetic interface lets the two share optimizations and avoid duplicated code. On formal verification, the explanation is that the smaller the shared code, the less there is to verify.
The first deliverable is the Rust crate Udon (zakura-udon). Udon is a low-level implementation of the Pasta curves and fields that replaces Common's pasta_curves fork and much of the arithmetic in halo2_proofs, the Halo 2 prover used by Ironwood. Previously, because of the generic ff/group traits, curve-specific optimizations had to go through extension traits and workaround functions, a technical debt that Udon resolves.
Udon decides the arithmetic approach, while the caller owns the execution environment and work buffers. It is no_std, does not allocate or spawn threads itself, and uses FftPlan and MsmPlan to fix the strategy and required storage up front so they can be reused. The Executor is fork-join, with a serial implementation and a Rayon adapter. The number of jobs and the memory limit are set with ExecutionOptions, and FFT and MSM can run incrementally so intermediate results can be consumed early.
Bento (zakura-bento), a compile-time companion crate, embeds prepared data in the binary and lets it be borrowed at runtime without copying, removing the duplicate-allocation cost Common still paid. Udon also flips the default: all field and curve arithmetic is variable-time, and only the parts that need side-channel resistance are explicitly marked. The reason given is that constant-time arithmetic was not practical in the prover.
This summary is based on the original; check the original for exact details.