Real receipts, not promises. Versioned milestones, shipped commits, and what comes next.
The heaviest circomlib reference circuit now compiles, generates a witness, and proves end-to-end. Optimized R1CS lands at ~1.49M constraints — below circom's own count — the witness verifies, and Groth16 prove + verify are measured. 162 E2E cross-prime tests still green.
Pre-compiled circuit templates serialized in bytecode. prove {} blocks are first-class values.
Export Groth16 verifier contracts for on-chain proof verification on Ethereum.
Frequency heuristic, tautological linear removal, Gaussian elimination, BN254 constant folding. EscalarMulAny 3.6x faster.
Import .circom templates and circomlib (Poseidon, MiMCSponge, EdDSA, BabyJubjub) directly. Constraint counts match circom O2 or beat it — Num2Bits 9 vs 17, LessThan 10 vs 20.
// import circomlib directly
use circom "poseidon.circom"
let hash = Poseidon(2)
.compute([secret, salt])
prove(hash: Public) {
assert_eq(
Poseidon(2).hash([secret, salt]),
hash
)
}
// 240 constraints — matches O2Tests that try to forge proofs prove constraint deltas are real LC folding wins, not under-constrained bugs.
In-browser WASM powers editor intelligence — instant LSP-grade diagnostics, hover, and completions as you type. Compilation, execution, and proving run on the server, with browser-session projects. Write and prove circuits online — no install.
VM runtime parameterized over FieldBackend. prove {} blocks use native field arithmetic for any curve.
AIR constraint backend using Plonky3 for transparent STARK proofs over the Goldilocks field — no trusted setup.
Import Noir programs as ProveIR modules. Use existing Noir circuits inside Achronyme alongside Circom.
Embed the Achronyme runtime in Rust apps via crate. Proc-macros, full interop. Targets Rust devs, not just ZK engineers.
Language specification freeze, backward compatibility guarantees, and stable bytecode format.