A distributed execution protocol built on three invariants: every block proven, every signature quantum-safe, every constitutional parameter enforced by the compiler — not by goodwill. Every block proven before broadcast. Every signature quantum-safe from genesis. Every core rule immovable by any actor — including the foundation. BLEEP has no past to protect.
Every protocol makes promises. BLEEP's promises are enforced by mathematics, compilers, and hash functions — not by the foundation, the validators, or goodwill. Each pillar eliminates a category of risk that every other chain leaves open.
On every other chain, block correctness is voted on — accepted on the basis of validator signatures, not proof. On BLEEP, every block proposal includes a Winterfell STARK validity proof generated before broadcast and verified independently before any vote is cast. You never have to trust the computation happened correctly. You verify it. Block correctness is a mathematical invariant — not a social assumption.
Traditional protocols require callers to manage bytecode paths across a growing stack of VMs, bridges, and gas models. BLEEP's PAT engine and 7-tier VM router resolve caller-declared outcomes to optimal execution automatically. You say what you want. The protocol resolves how — across Native, EVM, WASM, STARK, AI-Advised, and Cross-Chain engines. Complexity is the protocol's problem, not yours.
Quantum-resistant implies a classical foundation being defended. Quantum-native means BLEEP's consensus, identity, networking, state, and proof systems were designed around NIST-finalized post-quantum primitives from the first block. There is no migration path because no classical primitive was introduced. The cryptographic history of the chain carries no liability — from the first signature, permanently.
On every other chain, core parameters are governance-changeable. Sufficient coordination changes the rules on you. BLEEP's four constitutional parameters — 200M BLEEP maximum supply, minimum finality threshold, 500bps maximum inflation, and 25% fee burn floor — are enforced by Rust compile-time assertions. A code change that violates them does not compile. Governance cannot override the compiler.
Every chain planning a post-quantum upgrade is planning something that has never worked cleanly in the history of internet infrastructure — and inheriting every signature ever made as a permanent liability.
Building on NIST-finalized post-quantum primitives at Security Level 5 is not free. The overhead is real, quantified, and accepted as an explicit design trade-off. These are measured values from Protocol Version 5 — not projections or estimates.
Signature aggregation for hash-based schemes is an open research question. We are measuring the baseline before claiming the solution. The SPHINCS+ verifier Solidity contract is deployed on Ethereum Sepolia and callable without a trusted operator — available for independent inspection. Signature aggregation, STARK circuit expressiveness, and PQ bandwidth overhead under real validator conditions are active open questions being investigated during Phase 6.
↗ RESEARCH.md29 Rust crates organized into seven subsystem layers. The dependency graph is enforced at build time — a vulnerability in networking cannot directly access private key material. Each crate has exactly one responsibility.
Peter Shor's algorithm reduces the discrete logarithm problem — the mathematical foundation of every elliptic-curve signature scheme — to polynomial time on a fault-tolerant quantum processor. Bitcoin, Ethereum, and Solana are all vulnerable. This is not a future problem.
"Organisations should assume post-quantum-capable adversaries will exist within ten to fifteen years and build their security posture accordingly."
— Mohamed Mosca · Institute for Quantum Computing · 2018The threat is not a quantum computer today. The threat is archival. Adversaries are collecting signed transactions and public keys now. Every classical blockchain block ever produced is a permanently retrievable liability. Migration secures the future — it does not protect the past.
BLEEP has no past to protect.
Callers declare what they want. The VM Router resolves which engine handles it — automatically, deterministically, with unified gas metering across all seven tiers. The VM never writes state directly. Every result is a StateDiff committed atomically after validator quorum. You express the outcome. BLEEP handles the execution path.
Post-quantum from block zero. Every block proven before broadcast. Every constitutional parameter enforced by the Rust compiler — not by the foundation, the validators, or goodwill.
29-crate Rust workspace. 46 RPC endpoints. Devnet starts locally in minutes. Full source on GitHub under Apache 2.0.
SAFE · Convertible Note · $10M valuation cap. Targeting institutions and strategic partners with long-horizon thesis. Internal audit complete. Phase 6 testnet underway.
STARK proof benchmarks, PQ bandwidth overhead measurements, and a SPHINCS+ verifier contract on Ethereum Sepolia are available now. Grant applications open — EF ESP aligned.