AETHERMOOR / RESEARCH
Proposed integration Research pass · 17 Nov 2026

A system idea translated without flattening the metaphor

The hardware-defined radix lattice

Keep the byte exact. Give it a second, hardware-shaped view. Sweep every bit forward and backward, let phase-offset paths negotiate a shared field, and keep a receipt for every place they touch.

The honest boundary: generalized radix, local dataflow, phase binding, hard-exclusion placement, and programmable fields already exist. Their full receipt-preserving composition—and any learning advantage—has not been demonstrated.

26 / 26local carry + phase tests passed
256byte identities remain canonical
0new entropy claimed
1bounded experiment proposed

The translation

The bullet becomes a record. The wake becomes a trace. The wind becomes a field.

01

Exact carrier

The original eight bits stay attached to the byte. Geometry can route identity; it does not replace identity.

02

Radix view

βH changes the positional projection used by the experiment. It is a typed view until an inverse is proven.

03

Phase sweep

Forward and reverse records propose cell-time paths. A phase offset changes proposal order and direction.

04

Receipt field

A legal path reserves its cells. Rejected proposals, held reservations, and accepted routes remain countable.

Canonical identity

x = Σ bi · 2i

This is the byte that must round-trip exactly.
Task view

vβ(x) = Σ bi · βHi

This may organize a route; it does not create a second byte.

Interactive mechanical sketch

Give the wind a value. Watch the routes negotiate.

This browser sketch is intentionally small and deterministic. It preserves a canonical bit receipt, generates forward and reverse path proposals, and rejects cell-time collisions. It is not a neural-network result or a hardware simulation.

Bit receipt10101101
β view—
Accepted routes—
Rejected proposals—
Exact byte replay—

The visual may show lines crossing in two dimensions when they occupy different time bins. The collision ledger uses discrete (x, y, t) cells. Shared identity is not inferred from proximity.

Evidence-ranked map

What is established, what is adapted, and what still has to earn its name.

Existing

Radix and signed digits

Non-integer bases and redundant signed digits are established mathematical tools. They come with admissibility, uniqueness, conversion, and hardware-cost constraints.

Rényi, 1957 · Avižienis, 1961

Existing

Moving bit planes

Systolic and bit-serial machines already move values through regular local arrays. Flexible precision trades against additional cycles and control.

Kung & Leiserson, 1978 · BISMO, 2018

Existing

Phase and role binding

Circular convolution and coordinate permutation can bind roles and order. Bundled recovery is approximate, so the exact byte needs its own receipt.

Plate, 1995 · Sahlgren et al., 2008

Existing

First legal place wins

Hard-exclusion samplers and random sequential adsorption accept only separated placements. They can reject repeatedly and jam before full occupancy.

Bridson, 2007 · Feder, 1980

New candidate

The exact composition

Canonical byte identity + typed radix view + bidirectional phase sweeps + exclusion receipts + a declared field. The research question is whether this full contract improves a bounded routing or retrieval task.

The experiment that can say no

A strange mechanism earns its keep only after the ordinary scheduler gets a fair race.

Five matched arms

  1. Static first-fit binary routes
  2. Seeded random choice from the same proposals
  3. Ordinary collision-plus-length greedy routing
  4. βH + phase + field + reservations
  5. Shuffled byte-to-field binding

Hard gates

  • 256/256 exact byte round-trips
  • zero unintended accepted-route collisions
  • complete proposed / delivered / held / rejected accounting
  • deterministic replay from seed and receipt
  • multiple seeds and a held-out load

Promotion rule

The field arm must beat both static routing and the ordinary matched greedy arm by more than twice pooled seed standard deviation, without starving records or spending more proposals. Otherwise the result is UNDERPOWERED or NO GAIN.

Current claim

A seeded collision-aware radial-routing proposal that keeps canonical byte identity exact.

No hardware result, neural learning result, security gain, or general collision-free claim yet. That restraint is part of the design.

Return to the book experience