the proof system of cyber. builds on stark theory, then goes further: HyperNova folding replaces batch proving with incremental accumulation. zero trusted setup. post-quantum. sub-millisecond verification.
architecture
| component | role |
|---|---|
| IOP | SuperSpartan — constraint verification via sumcheck over CCS |
| PCS | Brakedown — expander-graph codes, no Merkle trees, O(N) field ops |
| folding | HyperNova — folds proof instances into a running accumulator |
| hash | hemera — algebraic hash, binding commitment |
| field | nebu — Goldilocks arithmetic |
| VM | nox — execution trace IS the constraint system |
the proof object
a zheng proof is a HyperNova accumulator (~200 bytes). it is not a classical STARK proof. the prover folds each computation step into the accumulator at ~30 field operations per step. validators run decide() to verify — one SuperSpartan + sumcheck + Brakedown check on the folded instance (10–50 μs).
the accumulator stays open so it can be folded further: signal accumulators fold into block accumulators, those fold into epoch accumulators. one decide() at the top verifies everything.
how it differs from stark
| classical stark | zheng | |
|---|---|---|
| PCS | hash-based (FRI/WHIR) | Brakedown (expander codes) |
| proof object | self-contained, large (~60-157 KB) | accumulator, tiny (~200 bytes) |
| verification | immediate | requires decide() |
| proving | batch, O(N) | incremental, ~30 field ops/step |
| aggregation | recursive composition | folding hierarchy |
see stark for the theoretical foundation. see zheng/specs/proof-types for every proof type the protocol generates.
discover all concepts
from subgraph zheng
the proof system for cyber. implements the Whirlaway architecture: SuperSpartan IOP + WHIR PCS + sumcheck protocol. zero trusted setup. post-quantum. sub-millisecond verification.
zheng (証 — proof/evidence in Japanese) provides the cryptographic machinery that turns nox execution traces into compact, verifiable proofs. one commitment, one opening, one proof.
COMPONENT │ ROLE │ INSTANCE
──────────────────┼────────────────────────────────┼─────────────────────
hash │ Fiat-Shamir, Merkle trees │ hemera
field │ arithmetic substrate │ nebu
VM │ execution trace generation │ nox
IOP │ constraint verification │ superspartan
core protocol │ exponential sum → log rounds │ sumcheck
PCS │ polynomial commitment │ whir
dependency graph
nebu (field)
↓
hemera (hash)
↓
zheng (proofs) ← this repo
↓
bbg (state)
see stark for the general theory, cyber/proofs for the full proof taxonomy