🔱 trident

the provable
language

every program compiles to prime-field arithmetic and produces a STARK proof — post-quantum, zero-knowledge, no trusted setup.

The weapon is their language. They gave it all to us. If you learn it, when you really learn it, you begin to perceive time the way that they do. So you can see what's to come.

$ cargo install trident-lang

then: trident build · prove · verify · audit · bench · fmt · lsp

write once, prove anywhere
1cycle per hash
(Tip5, native)
~100cycles, Merkle
proof depth 32
11 KBproof for
hello_proof
0trusted setup,
elliptic curves
proofs compose:
chains collapse to one

hello, proof

program hello_proof

fn main() {
    let a: Field = secret_read()
    let b: Field = secret_read()
    pub_write(a + b)
}

a cryptographic proof that a + b = 20 without revealing a or b.

$ trident build hello.tri
$ trident prove hello --secret 7 --secret 13
  Proof generated (924 cycles, 11 KB)
$ trident verify hello
  Valid: output = 20, inputs hidden
$ trident audit transfer.tri
  All 3 properties verified (0.2s)
  No counterexample exists for any input

bounded loops, no recursion, finite fields — verification is decidable, so audit proves correctness automatically.

why a new language

provable VMs are not CPUs. the machine word is a field element, not a byte — Rust compiled to RISC-V wraps every field operation in byte-level emulation. the gap is not marginal:

operationtrident on Triton VMRust on SP1Rust on RISC Zero
one hash (Tip5 / SHA-256)1 cycle~3,000~1,000
Merkle proof (depth 32)~100 cycles~96,000~32,000

built different

field elements all the way down

Field · Digest · XField map directly to what the VM computes. costs are known before you run: trident build --cost shows the proving bill statically.

formal verification, decidable

annotate #[requires] / #[ensures], run trident audit — the compiler proves correctness for every input in Field. no manual proof construction.

content-addressed code

every function's identity is the hash of its normalized AST. names are metadata; certificates travel with the hash, not the name.

the trust chain, broken

the compiler self-hosts and emits a STARK proof that compilation was faithful. Ken Thompson's 1984 backdoor dies here — not audited, proven.

the rosetta stone

one lookup table over Goldilocks reads four ways: hash S-box, neural activation, FHE bootstrap, STARK lookup. quantum · privacy · AI — one field.

proofs compose, calls don't

a proof verifies another proof inside itself. any chain of transactions collapses into a single cryptographic check.

where it runs

Neptune Cash — the only blockchain with recursive STARK proofs in production. trident is its native language, targeting Triton VM: fungible tokens, cards, locks and type scripts are specified in trident, compile to TASM today, and pass tests. the architecture expands targets over time without changing what a trident program is.