The intent-centric Layer 1
Parallel execution lanes. Encrypted batch ingress. Post-quantum cryptography. Zero-knowledge proofs. Zero MEV by construction.
Testnet Live
Parallel execution lanes. Encrypted batch ingress. Post-quantum cryptography. Zero-knowledge proofs. Zero MEV by construction.
MEV extracts billions. Sequential execution caps throughput. Classical cryptography has an expiry date. Smart contracts leak value. Rivellum solves all four at the protocol level.
Intents are encrypted inside ChaCha20-Poly1305 envelopes before submission. Validators never see content until after batch sealing. Execution order is derived from a BLAKE3 permutation of the seal hash — impossible to front-run.
Independent state lanes execute concurrently — each with its own database, Sparse Merkle Tree, and commit pipeline. Throughput scales linearly with hardware. No global lock. No sequential bottleneck.
Every signature uses CRYSTALS-Dilithium3 (ML-DSA-65). Key encapsulation via ML-KEM-768. No classical cryptography exists in the protocol — post-quantum from genesis.
Traditional smart contracts mutate balances directly — enabling reentrancy and unchecked value leakage. In Rivellum, contracts produce PVI graphs that the UVL verifies against 12 invariants before any settlement. Assets cannot be duplicated, destroyed, or moved without proof.
Every transaction flows through an 8-stage deterministic pipeline. Each stage is purpose-built. Each output is cryptographically verified.
Users declare a desired outcome wrapped in a ChaCha20-Poly1305 EncryptedEnvelope. The envelope enters the EncryptedAdmissionPool — there is no mempool. Content is opaque to all parties including validators.
ChaCha20-Poly1305 AEAD · EncryptedEnvelope · per-sender anti-DoS · 429 backpressureEnvelopes accumulate into time-windowed per-lane batches. When the window closes, the BatchLifecycleManager seals the batch and derives execution order via a deterministic BLAKE3 permutation of the seal hash. No party can predict ordering.
BatchLifecycleManager · 4-stage lifecycle: seal → decrypt → order → dispatchEach intent is routed by sender address hash (blake3(sender)[0] % lane_count) to an independent lane. Lanes are mapped to committees via modulo. This is deterministic address-based partitioning — not dynamic resharding.
blake3(sender)[0] % lane_count · committee_idx = lane_id % committee_countEach committee runs as an in-process thread group: one leader thread for nonce admission and signature verification, and W−1 executor workers. Lanes execute concurrently with copy-on-write state snapshots. No global lock.
PhotonExecutor · WorkerPool · gas metering · COW snapshotsEach lane has a dedicated LaneCommitter with its own RocksDB instance, WAL, and Sparse Merkle Tree root engine. State diffs are applied atomically. Same delta sequence always produces the same state root.
LaneCommitter · per-lane RocksDB · WAL with CRC32C · LaneRootEngineEach committee reaches local consensus on its own lane batches. Validators within a committee vote on batch ordering using Aurora BFT — pipelined Byzantine consensus with a three-chain commit rule and CRYSTALS-Dilithium3 quorum certificates. This gives sub-second lane-level finality.
Per-committee voting · three-chain commit · Dilithium3 QCs · equivocation slashingAfter lanes finalize independently, the MetaRootAggregator merges all lane SMT roots into a single global meta-root. Cross-lane operations settle via the CPC protocol with nullifier-based deduplication. The global meta-root is the canonical state commitment verified by all nodes.
MetaRootAggregator · global meta-root · cross-lane CPC · nullifier dedupZK proof composition aggregates execution proofs from all lanes. External chains verify Rivellum state in a single call. Winterfell STARKs, Plonky2, and Halo2 backends with recursive composition across 5 privacy circuits.
Winterfell STARKs · Plonky2 · Halo2 · recursive proof composition · 5 circuitsNo forks. No wrappers. Every subsystem is purpose-built and adversarially tested.
A resource-tracked language where contracts declare intent, not step-by-step mutations. Mist eliminates boilerplate — an escrow that takes 200 lines in Solidity fits in 20 lines of Mist. The compiler enforces correctness so you ship faster with fewer bugs.
Pipelined Byzantine consensus purpose-built for parallel lanes. Three-chain commit rule with CRYSTALS-Dilithium3 quorum certificates. Equivocation is detected and slashed. No leaders. No forks. No reorgs.
Winterfell STARKs, Plonky2, and Halo2 backends with recursive proof composition. Five privacy circuits generate real proofs — not mocked stubs. External chains verify Rivellum state in a single call through aggregated succinct proofs.
A protocol-level substrate for autonomous AI agents. Budget-capped agent wallets, trustless escrow, streaming payments, and a permissionless service marketplace — all settled through the same intent pipeline as every other transaction.
Six TypeScript applications and comprehensive Rust tooling for builders.
Write in Mist — a resource-tracked language with formal verification and native intent awareness. Deploy via CLI or Console. Query verifiable receipts through a unified API.
contract SimpleEscrow state seller: Address state buyer: Address state amount: Value state completed: Bool function create(seller_addr: Address, buyer_addr: Address, payment: Value) let seller = seller_addr let buyer = buyer_addr let amount = payment let completed = false function complete() require completed == false pay amount asset "USDC" to buyer let completed = true function cancel() require completed == false pay amount asset "USDC" to seller let completed = true
pay amount asset "USDC" to buyer compiles to HOLD→PAY. Debits = credits. Settled atomically.