Expand description
WHIR over the additive binary domain, and the adapters that feed it narrow traces.
Structs§
- Binary
Whir Budget - A ceiling a deployment refuses to prove above.
- Binary
Whir Domain - WHIR’s Reed–Solomon code over nested binary Cantor subspaces.
- Binary
Whir Profile - A named parameter profile for one proximity regime.
- Boolean
Whir Pcs - A commitment to a function from the hypercube to
{0, 1}, opened through WHIR. - Boolean
Whir Proof - One Boolean opening: the reductions, and the proximity opening that discharges them.
- Proof
Shape - Everything a schedule fixes about the size of its proofs and the work of checking one.
Enums§
- Boolean
Whir Error - Why a Boolean commitment or opening was refused.
- Budget
Error - Why a schedule or a proof was refused by the ceiling.
- Profile
Error - Why a profile could not be turned into a schedule.
Traits§
- Binary
Whir Alphabet - A binary alphabet the additive transform encodes over.
Functions§
- recommended_
cap_ height - Returns a Merkle cap height that every round’s tree can carry.
Type Aliases§
- Boolean
Whir Data - Prover-side data retained between committing and opening.
- Boolean
Whir Domain - The additive domain a bit witness packed into the widest tower level commits over.
- Boolean
Whir Prover - The proximity argument every packed claim is discharged against.
- Boolean
Whir Trace Pcs - A batched trace of Boolean columns, discharged through the additive-domain proximity argument.