a virtual machine designed for generating stark proofs of program execution

trident compiles to tir, then to TASM (Triton Assembly), which executes on Triton VM. every instruction produces a valid algebraic execution trace — the trace is the proof. arithmetic operates over the Goldilocks field ($p = 2^{64} - 2^{32} + 1$)

Triton VM uses nine Algebraic Execution Tables (AET) whose heights determine proof cost. see trident/reference/roadmap for neural optimization of the compilation pipeline

Dimensions

trident/vm/triton
🔱 TRITON [← Target Reference](/trident/reference/targets) Parameters | Parameter | Value | |---|---| | Architecture | Stack | | Field | Goldilocks (p = 2^64 - 2^32 + 1) | | Field bits | 64 | | Hash function | Tip5 | | Digest width | 5 field elements | | Hash rate | 10 field elements | | Extension…

Local Graph