Exact carrier
The original eight bits stay attached to the byte. Geometry can route identity; it does not replace identity.
A system idea translated without flattening the metaphor
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.
The translation
The original eight bits stay attached to the byte. Geometry can route identity; it does not replace identity.
βH changes the positional projection used by the experiment. It is a typed view until an inverse is proven.
Forward and reverse records propose cell-time paths. A phase offset changes proposal order and direction.
A legal path reserves its cells. Rejected proposals, held reservations, and accepted routes remain countable.
x = Σ bi · 2i
This is the byte that must round-trip exactly.vβ(x) = Σ bi · βHi
This may organize a route; it does not create a second byte.Interactive mechanical sketch
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.
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
Non-integer bases and redundant signed digits are established mathematical tools. They come with admissibility, uniqueness, conversion, and hardware-cost constraints.
Systolic and bit-serial machines already move values through regular local arrays. Flexible precision trades against additional cycles and control.
Circular convolution and coordinate permutation can bind roles and order. Bundled recovery is approximate, so the exact byte needs its own receipt.
Hard-exclusion samplers and random sequential adsorption accept only separated placements. They can reject repeatedly and jam before full occupancy.
Lattice, reservoir, wave-RNN, and oscillator systems can compute through local dynamics. A task, readout, and matched control are still required.
Frisch et al., 1986 · Hughes et al., 2019 · Wang & Roychowdhury, 2017
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
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.
No hardware result, neural learning result, security gain, or general collision-free claim yet. That restraint is part of the design.