INTERACTIVE PROOF MATRIX · RUNNING LIVE IN YOUR BROWSER
Five live, in-browser benchmarks of deterministic policy control, multi-hop lookahead, and fail-closed safety gates. All five demos compute every move with a JavaScript reference engine in your browser. Sokoban, Snake and 2048 also load the shipped Rust → WebAssembly reference kernel (/wasm/games_wasm_bg.wasm) for independent verification, but no gameplay call is routed through it. The decision loop calls no remote inference API, and every latency figure is measured on your machine.
Beam search proposes every move; an exact safety gate vetoes actions that open new covered holes. Measured live with 40-line clears and 0 LLM token generation.
Jump-diffusion market feed paired with an algorithmic mean-reversion strategy. Every single order is checked against 5 pre-trade invariants; rogue injections and flash-crash orders are vetoed by policy before they are placed.
Precomputed static dead-square table and recursive freeze-deadlock closure intercept unsolvable pushes before they land. Includes a node-budgeted BFS push-solver and an interactive level editor.
A greedy agent that checks only the next cell tends to box itself into dead-end cavities. Gen-Zero runs a breadth-first flood-fill reachability gate and projects 20-hop laser trajectories before every move; the page shows the measured gate latency for each tick.
Monotonic corner anchor gate vetoes moves that evict the max tile from its corner, with an on-demand 1~6 ply expectimax lookahead in the JavaScript reference engine.
Every move on these pages is computed by a JavaScript reference engine. The Sokoban, Snake and 2048 rules are also compiled from Rust to one Wasm module under 150 KB, which the pages load and which the repository tests check, but gameplay is not yet routed through it. No remote LLM inference API sits in the decision loop, so latency is bounded by local policy computation, not by a network round trip or token generation.
In enterprise decision circuits, safety cannot be an afterthought prompt instruction. Gen-Zero enforces hard pre-commit gates: if an action breaches topological or algebraic invariants, it is vetoed by policy before execution.
Unlike greedy single-step LLM reflexes that get trapped in local cavities, Gen-Zero combines static state reduction with bounded multi-hop tree search, reaching goals a greedy baseline misses on these diagnostics — a search result, not a formal reachability guarantee.