Eternal Haven

Home · Sovereign Lattice Mesh

Room · a mesh you can poke

The Sovereign Lattice Mesh

An interactive demonstration of three ways for small nodes to agree: Merkle sync, mycelium sharding, and harmonic vortex consensus. A demo, labelled as one.

Justin Helmer
Room guide · updated 6 November 2026 · about a seven-minute read

The mesh page is a toy in the honest sense: a working visualisation of three mechanisms, run in a browser, that lets you break things and watch what happens. It is not a network you can join and it is not a claim that any of this runs at scale. It is an argument you can click.

The live version is at the interactive mesh. This page is the manual, so that the click has a sentence behind it.

Three mechanisms, one question

Every distributed system answers a version of the same question: how do independent nodes agree on what is true without a referee? The demo shows three answers, each with a cost.

Merkle sync. Two nodes compare a single root hash first, and only walk down the tree where the roots disagree. It is how you can synchronise a large catalog by sending a few hundred bytes. The cost is that a node must be willing to trust the hash function and must keep a tree in a shape that can be walked. In the demo you can desynchronise a node and watch the walk find the difference.

Mycelium sharding. Split the catalog into shards that spread across nodes, so no single machine holds everything. The benefit is redundancy and the ability to run on cheap hardware. The cost is that a shard is only as durable as the number of places it lives, and healing after a node disappears takes time. The demo lets you remove nodes and watch availability degrade, which is a more useful lesson than a diagram.

Harmonic vortex consensus. The house's name for a weighted agreement round: nodes converge on a value by pulling toward a weighting function rather than a single leader. It is the most speculative of the three and the one I would defend least in a production argument. In the demo it shows convergence and, more importantly, divergence when the weights are adversarial — which is the behaviour you actually want to study.

What the demo is not

It is not a blockchain. There is no token, no mining, no economic incentive, and no claim that a browser simulation is a secure network. It is also not a benchmark: the timings you see are JavaScript on your machine, not a network under load. Anyone who reads a latency number off a demo and puts it in a slide deck is doing the thing this page is trying to prevent.

What it is good for is building intuition. Watching a shard go unavailable because two of its three holders left is a lesson that a paragraph cannot deliver as well. Watching a consensus round stall when one node weights itself too heavily is the same lesson in a different register.

Why this lives on a fiction publisher's domain

Because the books are about seals, accords, and what happens when a guarantee outlives its guarantor, and the software is the same argument with worse prose. The world page explains the fiction's version of a seal chain. This page is the version with hashes. Keeping them in one house is not confusion; it is the entire point of building both.

If the jargon is too thick, the glossary is the short door. If you want the policy that governs what gets built here — small, verifiable, one sitting — read Systems that break early.

Justin Helmer

Writes the Eternal Haven saga and the essays on this domain, publishes music as Excavationpro, and keeps the lantern on at /start.html.