Expand description
Constraint system and related definitions.
Modules§
Structs§
- AndConstraint
- AND constraint:
A & B = C. - Bmul
Constraint - BMUL constraint:
A * B = Cin the GHASH fieldGF(2^128). - Constraint
System - The ConstraintSystem is the core data structure in Binius64 that defines the computational
constraints to be proven in zero-knowledge. It represents a system of equations over 64-bit
words that must be satisfied by a valid values vector
ValueVec. - Imul
Constraint - IMUL constraint:
A * B = (HI << 64) | LO. - Proof
- A zero-knowledge proof that can be serialized for cross-host verification.
- Shift
- One shift: an operation paired with the distance it moves by.
- Shifted
Value Index - Similar to
ValueIndex, but represents a value that has been shifted. - Value
Index - A type safe reference to one word of the
ValueVec, as a segment and an index within it. - Value
Table - The witness for a batch of
2^kindependent instances of one circuit, in wire-major order. - Value
Vec - The vector of values used in constraint evaluation and proof generation.
- Value
VecLayout - Description of a layout of the value vector for a particular circuit.
- Values
Data - A run of value-vector words, decoded from its versioned on-disk form.
- Values
Ref - A segment of a value vector borrowed straight from a witness, ready to write.
- Zero
Constraint - Zero constraint:
VAL = 0.
Enums§
- Composition
- What the composition of two shifts denotes.
- Constraint
Kind - The kind of a constraint of a
ConstraintSystem. - Inout
Segment - Which of the two value-vector segments holds the inout values.
- Shift
Variant - A different variants of shifting a value.
- Value
Segment - The section of the
ValueVecaValueIndexnames.
Type Aliases§
- Operand
- Operand type.