An entire blockchain compressed into a single zk proof. Enabled by recursive zk light cLients.
One Bankai proof = full on-chain state, instantly verifiable by any application—no nodes, no relayers, no extra trust.
Our ZK light client trustlessly validates the newest blocks.
With every update, it verifies the proof from the previous update.
This creates a recursive “chain of proofs” (think Mina).
The result: the entire chain compressed into one single ZK proof.
We don't create consensus, we compress it. Each Bankai proof is a deterministic result of a chain's finalised history. This creates a single, canonical proof of truth that can be verified anywhere, instantly—no extra checks required.
Bankai makes on-chain state from any blockchain a verifiable, accessible resource. By composing recursive ZK light clients, we create a unified source of truth for your application.
This provides the trustless foundation to build:
Next-Generation Bridging:
Securely transfer assets or state between chains, with validity guaranteed by cryptographic proof, not a trusted committee.
Advanced ZK-VMs:
Directly stream provable on-chain data into your virtual machine. A Bankai proof is a self-verifying data packet—no need to manage headers.
Trustless Coprocessors:
Execute complex, off-chain computation on verified state from any connected chain, with results that are provably legitimate.
The security and trustlessness of the entire Bankai layer are direct inheritances from its deterministic, recursive ZK light client foundations.
Proving System
Cairo + Stwo = 💚
Cryptography
Garaga: efficient cryptography in Cairo
Stage 1
In planning
Stage 2
Also in planning
