Reiner Pope – Chip design from the bottom up

What It Covers

Reiner Pope, CEO of Maddox AI chip company, explains chip architecture from logic gates through multiply-accumulate units, systolic arrays, register files, clock cycles, FPGAs, and GPU versus TPU design tradeoffs, revealing why data movement costs dominate compute costs at every level of the hardware stack.

Key Questions Answered

• •Quadratic precision scaling: Halving numeric precision (e.g., FP8 to FP4) reduces multiply-accumulate circuit area quadratically, not linearly. A 4-bit multiplier requires 4× fewer gates than an 8-bit one. This is why NVIDIA's B300 reports FP4 as 3× faster than FP8, though the true theoretical advantage is 4×. Lower precision delivers disproportionate efficiency gains for AI workloads.
• •Data movement dominates compute cost: In a standard CUDA core with an 8-entry register file, the MUX circuits selecting inputs consume roughly 24×p AND gates just to move data, versus only 4×p gates for the actual multiply-accumulate logic. Over 85% of circuit area serves data movement, not computation. This imbalance motivated the introduction of tensor cores and systolic arrays.
• •Systolic arrays amortize communication: Tensor cores and TPU matrix units store weight matrices locally inside the systolic array, reusing them across many input vectors. This reduces register file bandwidth requirements from O(x²) to O(x), matching compute scaling. Weights are loaded slowly via daisy-chain over many clock cycles, trading load latency for dramatically reduced wiring bandwidth.
• •Clock cycle optimization tradeoff: Inserting pipeline registers between logic stages doubles achievable clock frequency but consumes additional area. Pushing clock speed too high means most die area goes to synchronization registers rather than compute logic, reducing throughput despite higher frequency. Optimal chip design balances gates-per-cycle against cycles-per-second, analogous to batch size tradeoffs in inference serving.
• •FPGA versus ASIC economics: FPGAs implement any logic circuit via programmable lookup tables (truth tables with 16 entries for 4-bit inputs) and configurable MUX routing, but each lookup table consumes ~32 gates to implement what an ASIC does in 3 gates. This ~10× area penalty is the direct cost of reprogrammability. First ASIC tape-out costs ~$30M versus ~$10K for FPGA deployment.
• •Cache versus scratchpad memory architecture: CPUs use hardware-managed caches that automatically decide whether data comes from fast on-chip memory or slow DDR, introducing nondeterministic latency. TPUs instead use software-managed scratchpads with explicit separate instructions for on-chip versus HBM access. This design choice gives TPUs deterministic latency at the cost of requiring programmers to manage memory hierarchy manually.