Equilibrium
equilibriums.site · testnet

A closed system that has to keep proving it is still itself.

Equilibrium is not a module list. It is an organism: perception, metabolism, memory, verification, and adaptation — modelled inside-out and outside-in. Testnet and mainnet run here, live, with a real stationary solver. No random residuals.

Open the explorerRun an ablationVerify the tip
Height
1,199
finalized 1197 · lag 2
Canonical R
5.567e-4
territory 2.405e+38
Mempool observation
0.000
0 queued · not the header
Validators
5
5,500,000 bonded

What you can do with EQU today

Measured on a fork of this kernel. This is not a listing, and it is not a promise that a balance here exists anywhere else.

  • worksA fork produced block 9. The residual was recomputed, not trusted.
  • worksThe ledger grew by 9 EQU. That is the liquid coinbase of 99. The rest, if any, is a validator claim, not a spendable balance yet.
  • works1,000 EQU moved from one key to another inside this kernel.
  • only hereThe EQU-USDC pool reserve changed by 10,000 EQU. The genesis liquidity address changed by 11,654 on the ledger, which is not that reserve. The pool is not that allocation. This swap does not settle on another chain.
  • worksAn unfunded transfer of 10,000,000,001 was refused by the mempool and by the transition. The sender stayed at 1,469,904. No recipient balance was created.
  • worksA signed withdrawal locked 1,000 EQU and settled when the Bitcoin output matched. The escrow was debited and no EQU address was credited. An Ethereum withdrawal of 1,000 settled when a Transfer log was proven against an admitted execution header. That header is not an EQU beacon, and Ethereum's sync committee is not verified. A p2pkh destination on Ethereum is refused. A header lock is not this path.
  • only hereThis fork produced its own block and did not start another producer. Separately, a second body given only the blocks produced the next block, and a third body accepted it. The Rust crate does not mine them.

What still has to be specified

One state and one set of inputs should force one next state, whichever body runs the transition. successor already does that for one fully specified input. These rows are what that input has to contain, and where EQ-00 through EQ-21 are silent or say something the executable does not do.

  • nonce · EQ-04 names a search. It does not name which nonce. · Nonces 36 and 46 both clear the threshold. Residuals differ (0.00024711927978383826 vs 0.0012692509330869022). Ω does not, because quality is clipped at 1. The nonce must be fixed for the block. It is not what fixes Ω under that clip.
  • miner · The miner must already be a live validator in Ω. · Two live validators are two states. A stranger is refused.
  • timestamp · EQ-05 requires monotonic time. It does not pick the timestamp. · Timestamp is an input. It is stored on Ω and it sets the next difficulty.
  • pressure · EQ-02 commits pressure as block evidence. It does not derive it from Ω or from the receiver mempool. · Pressure outside [0, 1] is refused. Pressure inside [0, 1] changed Ω. The committed value is the input. The receiver's mempool is not.

Living loop

Inside ↔ outside

R 5.567e-4
P 0.000

Inside → outside

Metabolism
Stationary solve
Transition
Ωt → Ωt+1
Memory↔
Blocks / state root

Outside → inside

Perception
Network / mempool
Immune
Independent evidence
Stabilise
BFT, lag 2

Closure 32 · inbound 16 · outbound 32. Internal state generates a candidate; the environment returns evidence; memory updates only if the candidate still belongs to this constitution.

Live events

  • closeΩ1199 committed · stateRoot e7b56e1338…
  • outR=5.567e-4 nonce=1794029956 iters=0
  • closeΩ1197 stabilized · lag 2
  • outdiscovering stationary nonce at height 1199
  • inpressure 0.000 · 0 queued · 0 selected
  • closeΩ1198 committed · stateRoot 904aa73df8…
  • outR=1.103e-3 nonce=1167402682 iters=3
  • closeΩ1196 stabilized · lag 2

Latest blocks

All

What this node will not claim

  • The theory does not prove the code. Ablation tests the couplings.
  • Territory residual from the Rust solver saturates. Canonical residual is the rebuild quantity used for admission.
  • ZK does not prove the full state transition. Light bodies recompute residual; they do not re-solve.
  • New blocks bind chain id 2. Genesis 7ecaa567…613cee38 is this network's header, not a shared object.
  • The header state root is stateRootOf. Validators, delegations, proposals, couplings, difficulty, and finalized height move the omega digest. They do not move that root.
  • An account or UTXO proof checks the stored root. That root is not the header, and the header is not that proof.
  • The block store does not treat a missing database as a durable write. A conflicting row or a failed write is not announced. A later candidate waits, then it is checked against the tip that remains. Death during the write is not one fact in memory and on disk.
  • A phone that does not yet know the post-state fills that root with 64 zero bytes. That hash is the phone's tip. The native header stops before the transition digest. It is not the seal this node admits.
  • A gossip body keeps the transaction list it carries. An empty list stays empty. This node does not replace that list, or the pressure in the body, with its own mempool. An HTTP submission does not carry a producer list. This node selects from its mempool, and the successor replaces the submitted hash.
  • A restored row is kept only when its transaction list is the one it committed and the successor recomputes that stored identity. Unsigned history is refused, not grandfathered. Canonical evidence that does not replay does not start this node. A snapshot parent walk is not that recomputation. A missing ancestor is not a reason to delete the suffix that snapshot still names.
  • The transition is successor, not this process. One next state once transactions, evidence, miner, and timestamp are fixed. At least 2 nonces in a window of 512 satisfy the residual predicate and share one Ω. A vote changes Ω only inside the block.
Claim auditEQ specifications