The AI industry is building nuclear power plants to run inference on
architectures that waste most of their energy before doing any useful
work. The structural alternative -- where a 32,768-token vocabulary
requires 93 routing lines, 3 transistors, and no clock -- has been
sitting in a guitar amplifier since the 1990s.

━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━

The AI industry's response to its thermal crisis is infrastructure.
Bigger power supplies. More cooling towers. Nuclear reactors -- $5B to
$15B each, 8 to 15 years to build -- to power data centers that run
inference on architectures that haven't fundamentally changed since
the 1950s.

This is the wrong direction. Not because the infrastructure won't
work. Because it treats the symptom while the cause continues
generating heat unchecked.

THE CAUSE

Every time a large language model looks up a token -- and it does this
millions of times per second -- the following happens:

  1. A binary address is generated
  2. The address passes through a decode tree (millions of switching gates)
  3. It clocks through registers (clock tree: ~35% of chip power)
  4. It accesses a memory bank (row and column lines charge, sense amps fire)
  5. The result travels back across a bus to the compute unit

Every arrow in that sequence generates heat. Every gate in the decode
tree switches. Every register edge fires. Every sense amplifier draws
bias current. All of it, for every token, every millisecond, at
gigahertz speeds.

This is P = C × V² × f applied to millions of events per second.
The power consumption is not a flaw in the implementation. It is
what the architecture requires.

THE STRUCTURAL ALTERNATIVE

The DTL diode-directed one-hot topology (previously posted here as
the Tri. Flop ternary cell and the One-Hot ASCII cell) follows a
different principle: position IS the data state.

When a token is held in an N-way one-hot cell:

  - Exactly one transistor conducts
  - All others draw absolute zero current
  - No address to decode -- the input line IS the address
  - No clock -- the state changes at electric field propagation speed
  - No memory bank -- the cell holds and outputs simultaneously

Token lookup becomes: pull one input line LOW. The N-way network
collapses to the selected state via electric field propagation. Done.
No decode tree. No clock edge. No memory access. No bus traversal.

THE VOCABULARY ACCELERATOR

A modern LLM uses Byte-Pair Encoding (BPE) to group characters,
words, and common phrases into tokens. A typical vocabulary contains
32,000 to 100,000 unique tokens.

The standard approach: binary address into a lookup table. Clock
cycles. Memory access. Switching energy on every lookup.

The structural approach: a hierarchical matrix of N-way one-hot cells.

THE ROUTING MATH (verified, not estimated)

For a 32,768-token vocabulary using a symmetric 3-level 32×32×32 matrix:

  Level 1: 32-way cell -- 31 routing lines (selects token category)
  Level 2: 32-way cell -- 31 routing lines (selects token subgroup)
  Level 3: 32-way cell -- 31 routing lines (selects specific token)
  Total:   93 routing lines for 32,768 unique tokens

Compare to the naive flat one-hot approach (one line per token):
  32,768 routing lines for 32,768 tokens

Compare to the two-level 128×256 hierarchy:
  382 routing lines for 32,768 tokens

The 32×32×32 cube requires 93 routing lines. Each level has a maximum
of 32 junctions on its shared node -- well within the demonstrated
operating range of the discrete circuit (verified to 18 positions in
LTSpice, in production use at 6 positions since the 1990s).

The general law: for k symmetrical levels with N positions each,
total routing lines = k × (N-1), and active transistors = k.

  k=3, N=32:  93 lines, 3 transistors
  k=5, N=8:   35 lines, 5 transistors (8^5 = 32,768)

As...