SOLANA-NATIVE · ZK COMPUTE LAYER

Off-chain compute,
proven on Solana.

Proofra runs heavy workloads off-chain, generates a cryptographic proof of correctness, and folds many proofs into one — verified directly on-chain in a single transaction.

DIRECT VERIFY0.500 SOL
FOLDED VERIFY0.0001 SOL
SAVINGS99.9%
ON-CHAIN COST< 200K CU
THE SOLUTION / RECURSIVE FOLDING

Fold many proofs
into one.

SP1 generates a proof per sub-computation. Nova folds them — recursively, instance by instance — into a single SNARK. The Anchor verifier on mainnet checks the folded proof in under 200K compute units, no matter how much work it represents.

01

SP1 v3 zkVM (Succinct) for the guest programs.

02

Nova / SuperNova folding for non-uniform IVC.

03

Anchor program on Solana mainnet for verification.

100 SUB-PROOFS FOLDING 0%
100 sub-proofs · direct
0.500 SOL
Folded · single tx
0.0001 SOL
Cost reduction
99.9%
CORE PRIMITIVES / 06

Six primitives,
one verified surface.

Every Proofra capability resolves to the same thing: a fact you can check on-chain before you act on it.

01

ZK Compute Network

Submit a workload, the network executes it off-chain and returns a verifiable result. No trusted operator in the loop.

02

Recursive Proofs

Nova folding collapses N sub-proofs into a single SNARK — verification cost stays flat as the work grows.

03

Solana Verification

An Anchor program verifies the folded proof on mainnet in under 200K CU and writes a ProofRecord PDA.

04

Developer SDK

One CLI, three commands. The same proofs your dApp would generate — plus CPI for on-chain composition.

05

Proof Marketplace

Producers publish verified facts as Pyth-style feeds; consumers subscribe by hash. Proof bytes stay off-chain.

06

AI & Data Verification

Prove an ML inference actually ran, or a data pipeline produced a result — gate mints, agents and feeds on it.

ARCHITECTURE / THE PIPELINE

Five layers, one path
from input to proof.

  1. 01

    Submission

    Applications POST a circuit id, an input blob and a callback. The job is queued to an SP1 host pool.

    INPUT
  2. 02

    Proving

    The SP1 v3 zkVM executes the guest program off-chain and emits a succinct proof per sub-computation.

    SP1 zkVM
  3. 03

    Folding

    Nova / SuperNova folds the sub-proofs recursively into a single Groth16 SNARK — constant final size.

    NOVA IVC
  4. 04

    Verification

    The Anchor program runs verify_proof on Solana mainnet and writes a ProofRecord PDA seeded by hash.

    SOLANA
  5. 05

    Marketplace

    Verified results publish as Pyth-style feeds. External dApps subscribe by hash and read proven facts.

    FEEDS
THE NETWORK

Heavy by design.
Light on-chain.

A field of provers does the expensive work. Solana only ever sees the folded result — a few kilobytes, a single transaction, a permanent record.

ROADMAP / FOUR PHASES

From proof engine
to proving network.

PHASE 1SHIPPING

Core protocol

Protocol architecture, proof engine and verifier integration on Solana mainnet.

PHASE 2NEXT

SDK & market

Developer SDK, the proof marketplace and operator onboarding.

PHASE 3PLANNED

Recursion & AI

Recursive proofs, AI verification modules and ecosystem expansion.

PHASE 4PLANNED

Decentralize

Decentralized proving network, cross-chain verification and ecosystem grants.

COMPUTE · PROVE · VERIFY

Start proving the
work that matters.