v0.3.0 — Real WASM engine running in browser

Beyond Quantum.
In Your Browser.

MDB-OS replaces exponential memory scaling with sparse state representation. 64 positions. 2 states. 168 bytes. No lab. No cloud. No limit.

168 bytes
64-position GHZ state
295 EB
Same state, dense register
∞ positions
No upper limit on register width
The core insight

Every quantum simulator stores 2n amplitudes. MDB-OS stores only the states that actually exist.

01
Sparse Register
A HashMap<u64, Complex> that stores only populated basis states. The register doesn't care how wide it is — only how many states are occupied. 64 positions with 2 populated states = 168 bytes. Not 295 exabytes.
02
peek() · fork() · replay()
Three operations that quantum hardware provably cannot have. Non-destructive state inspection. Lossless state cloning. Deterministic re-execution. These aren't debug features — they're designed capabilities.
03
Dimensional Cascade
Every binary pattern gets a geometric identity via Fibonacci-scaled coordinates converging to φ. The SuperBit B = (σ, Ψ, W, A, G) is embedded in ℝ, turning search into geometry instead of enumeration.
See it run

Open the browser desktop, launch Terminal, and type:

MDB-OS Terminal
// Create a 64-position GHZ state $ sparse 64 ── MDB Sparse Register: 64 positions ── |000...0⟩ prob = 0.5000 |111...1⟩ prob = 0.5000 Populated states: 2 Memory used: 168 bytes Dense equivalent: 295,147,905,179,352,825,856 bytes Sparsity: 1.08 × 10⁻¹⁹ // Non-destructive readout — state unchanged after peek $ peek 64 peek() called twice — identical results ✓ // This is impossible on quantum hardware.
How MDB-OS compares

Not a faster quantum simulator. A different computational primitive.

Quantum Hardware
Classical Sim
MDB-OS
Memory at 64 positions
Physical hardware
295 exabytes
168 bytes
Non-destructive readout
Impossible
Possible
peek() — native
State cloning
No-cloning theorem
Full copy (expensive)
fork() — O(k) sparse
Deterministic replay
Non-deterministic
Possible
Seeded PRNG — native
Runs on
$10M+ lab
Supercomputer
Any browser
Position limit
~1,000 noisy
~40 (memory wall)
None (sparse)
What's inside

Written in Rust. Compiled to WebAssembly. Running in your browser right now.

Sparse Quantum Register
HashMap<u64, Complex> with full gate set — H, X, Y, Z, S, T, CNOT, CZ, SWAP, Toffoli, Fredkin, QFT. Auto-pruning keeps memory tight. No position limit.
🔬
Algorithms
Grover's search, Deutsch-Jozsa, Bernstein-Vazirani, quantum phase estimation, variational optimization. All running on the sparse register.
🌀
SuperBit Geometry
B = (σ, Ψ, W, A, G) — the multidimensional binary primitive. Dimensional cascade coordinates via Fibonacci scaling. Geometric search instead of blind enumeration.
🖥️
Browser Desktop
Full desktop environment with Terminal, Experiment Lab, Circuit Designer, and Settings. 322 KB WASM binary. No install. No server. No API key.

The foundation is built.
The numbers are verified.

Open the desktop. Run sparse 64 yourself. See what 168 bytes can do.