BLACKOUT EXCHANGE
Leaderless Emergency Agent Economy
"Settlement is unlocked only after verifiable coordination proof."
No Central Orchestrator
Autonomous Failover
Adversarial Rejection
Proof Before Payment
The Problem
Centralized Coordination Breaks Under Pressure
Single Point of Failure
One coordinator goes down — the entire operation stalls. There is no graceful degradation, only cascading halt.
Adversarial Claim Risk
Any agent can assert task completion. Without verifiable proof, fraudulent claims pass the settlement gate unchallenged.
No Auditability
Centralized logs are mutable and opaque. Disputes cannot be arbitrated from first principles after the fact.
Solution Overview
A Leaderless Coordination Engine with a Proof Gate
BLACKOUT EXCHANGE replaces the central orchestrator with a network of autonomous agents. Coordination is local. Settlement is conditional. Nothing pays out without proof.
Each stage operates independently. The gate is the only choke point — and it is intentionally strict.
System Principles
Four Non-Negotiable Design Pillars
No Central Orchestrator
Agents discover peers and negotiate tasks locally. No master process owns the coordination graph.
Local Consensus
Task negotiation happens bilaterally between agents. Quorum is established from the bottom up, not top down.
Deterministic Simulation
Seeded runtime guarantees bit-identical replay. Every tick is auditable and reproducible on demand.
Safety-First Settlement
Proof conditions are evaluated sequentially. Settlement remains blocked until all four gate conditions clear.
Architecture
Architecture Layers and Module Boundaries
UI Layer
Next.js 15 + React Flow renders live agent state. Playwright drives the guided 8-step judge demo.

Simulation Domain Layer
Five core modules run in deterministic tick order: peer-discovery → negotiation → execution → failover → verification-settlement.

Runtime State Layer
Zustand holds all agent and tick state. Seeded engine guarantees replay fidelity across runs.
Tick Engine
Deterministic Tick Progression and Module Run Order
Each tick is a discrete, ordered evaluation cycle. Module sequence is fixed — not configurable at runtime. Order encodes causality.
Why Order Matters
Failover cannot run before execution. Verification cannot run before proof generation. Causality is structurally enforced.
Seeded Determinism
Same seed → same tick sequence → same outcome. Supports reproducible demos and post-hoc audits.
Settlement Gate
Proof → Verification → Settlement: Four Conditions, Zero Exceptions
The settlement gate evaluates four conditions in sequence. All four must pass. A single blocking reject halts payout regardless of other signals.
1
Witness Quorum
Minimum number of agents must have observed the task execution event.
2
Confidence Threshold
Aggregate confidence score across witnesses must exceed the defined floor.
3
Verifier Quorum
A majority of designated verifiers must approve the submitted proof artifact.
4
No Blocking Reject
Zero verifiers may have issued a hard reject. One reject freezes the gate.
Failure & Adversarial Handling
The System Stays Honest Under Attack and Failure
Node Failure
A silent agent is detected at the failover tick. Tasks are reassigned to available peers. Coordination continues without human intervention.
Fake Completion
An agent submits a fabricated proof artifact. Verifiers evaluate independently. Divergence from witness records triggers a hard reject.
Settlement Blocked
One blocking reject is sufficient to freeze the gate. No partial payout. No override path. Risk = blocked, always.
Live Demo
8-Step Judge Demo: Discovery to Summary Handoff
Manual Pacing Control
Prev/Next step buttons let the presenter pause at any gate decision for jury Q&A. No auto-advance, full control.

Validation Gates Passed
ESLint
Zero warnings on full codebase
Build
Clean Next.js production build
E2E
Playwright suite: all steps verified
CI
Automated gate in pipeline
Mission Summary
Replay, Trust Evolution, and the Path to Production
Why Tick Replay Matters
Every coordination event is replayable from seed. Auditors can step through causality tick-by-tick. Explainability is structural, not documented after the fact.
Simulation Boundary Transparency
The current runtime is a deterministic simulation — seeded, not on-chain. Agent behavior, proof logic, and gate evaluation are fully operational. External chain integration is the next adapter boundary.
Production Transition Path
What This Deck Proved

"Coordination without a center. Settlement without trust assumptions."
Questions?
1
submitProof
Anchor proof artifact on-chain
2
verify
Call external verifier contract
3
release
Trigger conditional settlement transfer
Leaderless coordination is operationally viable
Adversarial agents are structurally rejected
Settlement gates hold under failure conditions
Full replay audit chain is intact from tick zero
Made with