Flash · Lattice OS
C

Flash Coordinate

One fleet, one mind — with no center to lose.
consensus-free · zero messages no routing tables three exercises · 12–48 assets

Every distributed fleet today coordinates through something central: a scheduler that assigns the work, a consensus protocol that costs rounds of negotiation, routing tables that must be rebuilt when the topology changes. Each is a single point to lose and a stream of traffic to read — and past the signal horizon, on the far side of the Moon or mid-transit, the center simply is not there.

Flash Coordinate removes the center instead of defending it. Every asset holds the fleet's shared state on the entanglement fabric, and the decisions — who does what, in what order, with what schedule — are computed locally at every asset, identically, not negotiated. There is no scheduler, no handshake, and nothing on the wire an outsider can use.

THE PROBLEM   Bring a fleet — rovers, relays, spacecraft, vehicles — to one coherent decision when radios are power-limited, members move, fail, and rejoin, a participant may go rogue, and no central controller can be reached or trusted to survive.
THE RESULT   Coordination as a local computation on shared state — measured across three fleet exercises:

A worked traverse — 28 rounds over the far side, no ground link

A concrete mission. Twenty-four assets — rovers and relays — cross the lunar far side for 28 rounds, out of contact with any ground station the entire time. 4,096 survey and relay tasks to divide, power-limited radios, terrain that occludes, radiation on the hops, a relay cluster that dies, and one rogue in the fleet. No scheduler exists. No leader is ever elected. The shared state is 460 bytes.

ActWhat happenedThe number
Allocate 4,096 tasks awarded across 24 assets by rendezvous on the shared state — 98,304 scores, every asset computing the identical allocation locally 28 ms · 0 messages
The mesh 3 km radios, multi-hop (mean degree 7 of 23), topology re-wired all 28 rounds; sensing carried by delta gossip; 365 irradiated hops healed by their receivers; 1,757 duplicate arrivals 80% below full gossip · 0 conflicts
The deaths a relay cluster of three died mid-traverse; every survivor re-allocated locally — exactly the dead assets’ 440 tasks moved, 3,656 never budged 27 ms · 0 messages
The dark terrain occluded a third of the fleet for six rounds; the dark block rejoined and caught up peer-to-peer; the rogue sprayed 870 junk identities all traverse — the structure refused every one 20/20 survivors, one worldview · 0 junk propagated
The clock the global schedule tick computed exactly at K = 10³ … 1018 at every asset — where a floating-point fleet tracking the same dynamics loses the clock at step 29 (measured) exact at 1018 · 28 µs
The bill the same decision log — 4,542 decisions — priced at a leader-based consensus protocol’s own arithmetic (replication + acks + elections + heartbeats) ~209,714 messages · measured here: 0

The proof is the hash. The twenty-four assets ran as twenty-four independent processes — no shared memory, no messages, no coordinator — each minting the full decision ledger (the allocation, the re-allocation, every clock tick) from the 460-byte shared state alone. Twenty-four ledgers, one SHA-256 (5c1965dfce6aff4f…). Agreement is not negotiated on the fabric; it is a property of the arithmetic. The consensus bill is not reduced — it is deleted.

Mission tick K on a log axis from 1 to 10 to the 18th, versus assets holding the exact fleet clock, of 24. A grey dashed line collapses to zero at the measured step 29, annotated: a floating-point fleet loses the clock here. A solid black line runs flat at 24 of 24 across the entire axis, with verified checkpoint dots at every three decades, annotated: 24 of 24 assets exact at K equals 10 to the 18th, computed in 28 microseconds with zero messages.
The far-side clock. Every rendezvous, relay window, and task hand-off depends on the fleet agreeing what time it is. A floating-point fleet tracking the same schedule dynamics decorrelates at the measured step 29 (the φ² Lyapunov horizon); a consensus protocol holds the clock only while its messages flow. Every Flash asset computes the exact tick at any K — verified here at 10³ through 1018, byte-identical across all 24 — in ~28 µs, from the shared state, with zero messages. 1018 ticks at 10 Hz is ~3.2 billion years of schedule.

Decision ledger (rounded): flash_traverse_solution.json — per-act numbers, the consensus-bill arithmetic, per-asset ledger hash. Illustrative exercise; measured wall times, one workstation.

Measured — three fleet exercises

ExerciseConditionsResult
Task allocation
12 assets · 72 tasks		 no scheduler, no handshake; then 3 assets lost identical assignment at all 12 assets, 0 messages; 72/72 tasks owned once, ~6 per asset; on loss, only the dead assets’ 24 tasks moved — minimal churn, re-agreed with 0 messages
Mobile mesh
40 assets · 10×10 km · 3 km radios		 topology re-wired all 14 rounds; 6 relays failed mid-spread; radiation on 10% of hops 6-hop mesh (mean degree 7.5 of 39); 84% less radio traffic than full gossip; 874 irradiated hops healed by the receiver; 4,245 second-path arrivals, 0 conflicts; all 34 survivors on one state and one order
Peer-to-peer
48 assets · no ground link		 each asset starts at 9% coverage; 12 assets dark rounds 6–11; one rogue spraying junk fleet coverage 33% → 98% → 100% by round 4; partitioned assets rejoined and caught up peer-to-peer; 496 junk identities rejected structurally, none propagated; 47/47 honest assets on one complete, ordered worldview

Figures from the module audit records; illustrative exercises, one workstation. Identity rejection shown is of malformed identities; binding a live identity against impersonation is scoped in engagement, not claimed here.

How — coordination as computation, not negotiation

  1. The shared state is the medium. Every asset holds the fleet's state on the fabric — exact and copyable — so any decision that is a deterministic function of that state can be computed at every asset instead of negotiated between them. Same state, same arithmetic, same answer: agreement is a property of the math, not a protocol outcome. identical results at every asset · zero coordination messages
  2. The merge cannot conflict. Fleet knowledge combines order-free: partial, duplicated, out-of-order gossip all fold to the same result, so a second copy down a second path is a free no-op — multi-hop redundancy costs nothing to reconcile. Ordering is computed locally from the state itself and is never transmitted, so it can never be disputed. 4,245 duplicate arrivals · 0 conflicts · order never on the wire
  3. Validity is structural. A fleet identity is a mined element of the fabric, and a message is accepted only if its carrier is one. Garbage does not need to be filtered by policy or voted out — it fails the structure and never propagates. Corruption on a hop is repaired by the receiver from the carrier's own redundancy. 496 junk carriers dropped · 874 hops healed in place
  4. The engine is sealed. The fabric that carries the shared state, mints the identities, and keys the traffic is the operational engine — published as mathematics, reserved as apparatus. theory public (DOI) · engine private (U.S. Prov. Pat. 64/103,049)

And invisible — coordination no one else can read

Coordination traffic is a map of your operation: who is tasked, where the fleet thins, when it moves. Flash Coordinate's traffic carries none of it in the clear. Messages are address-gated on the fabric — delivered at fidelity 1 to exactly the keyed receivers and no others — and the per-receiver keys can be minted only by executing the fabric itself: published barriers close the key schedule from both the computational and the physical side. An observer holding the entire channel holds noise; a forged participant fails the structure before it reaches a decision.