Proving Programs
A proof is what makes a ZisK computation trustworthy. Run the prover over your guest program and get back a cryptographic object that anyone can verify without re-executing the code or seeing the inputs. This section covers the full proving pipeline.
Start here
Your first proof
Prove and verify your first guest program end to end using the fibonacci example.
Read more →Configuration
Choosing a prover client
Configure the prover backend, embedded or remote, and tune its options.
Read more →Configuration
Choosing a proof output
Understand the proof types (STARK, Minimal, and the pilfflonk final SNARK) and when to use each.
Read more →I/O
Managing basic I/O
Write inputs into the guest with Stdin and read public values back out of a verified proof.
Read more →I/O
Verifying a proof
Load an existing proof from disk, verify it cryptographically, and read the committed public values.
Read more →Advanced
Aggregating proofs
Fold proofs into one recurser proof with an aggregation definition, locally or on a coordinator.
Read more →