YHK - yet another hacker news clone

The Inference Hardware Revolution of 2026

148 points vinhnx 20 hours ago 17 comments

_superposition_ 16 hours ago | parent

Excellent article. I believe the majority of benchmark performance gains moving forward will come from this side of the stack enabling faster iteration/recursion.

geoffbp 16 hours ago | parent

> And Anthropic is paying LLM competitor SpaceXAI over a billion dollars per month to lease spare compute

I knew of this but not the $ amount. Wow

cma 16 hours ago | parent

Big money from taking Tesla's place in line for an Nvidia shipment during a huge shortage without compensation.

ninju 15 hours ago | parent

Great read.

I like how the author uses the analogy of scrabble word creation to describe LLM training but unfortunately the analogy didn't continue to inference and I got lost trying to keep up.

mathisfun123 13 hours ago | parent

The analogy is flawed - in Scrabble you get rewarded for unlikely word combos. Also causal attention attends to prior tokens (tiles already placed).

aschla 14 hours ago | parent

"If AI inference remains as desirable as Kimball expects, the evolution is likely to follow the same trajectory as the CPU. The CPU didn’t improve along a single axis but instead across simultaneously. Once transistor scaling slowed, chip and system architecture innovations of all kinds proliferated. The list of individual innovations that led to today’s ubiquitous, powerful personal compute could fill dozens of books. A few decades from now, the history of AI inference innovation will show similar depth."

Of the areas mentioned in the article, which are the most likely to have the most prominent innovative impact, and what will they entail?

jjtheblunt 13 hours ago | parent

> The list of individual innovations that led to today’s ubiquitous, powerful personal compute could fill dozens of books.

https://a.co/d/0dMk8urP

which is the Hennesey and Patterson computer architecture book would serve the role of the "dozens of books" hyperbole rather well.

rhdunn 12 hours ago | parent

One of the biggest limitations right now is memory capacity (storing large models/contexts in memory) and bandwidth (transferring the relevant data/weights to the silicon that is performing the operations on that data). This would cover things like:

1. having more memory on the card/chip and/or faster access to that memory;

2. integrated memory and compute units optimized for matrix and vector multiply add operations;

3. optimized load circuitry to e.g. read memory in the stride and span (next row, next column) access patterns common to matrices or ensure that no/few parts of the chip are stalled waiting on data or operations to complete.

Another aspect is quantizations. These are similar to SIMD vector operations in that you are performing an operation on a block of n-bit data values at the same time, so can have optimized circuitry.

For 2 or 3 valued quantizations you can reduce various addition and multiplication operations to logic operations, avoiding circuitry for things like the half-adder, full-adder, and carry-lookahead.

Then there's adding specific circuitry for common operations such as ReLU like is done in hardware acceleration of image, video, etc. processing. There's a trade off here as optimized hardware would perform better at the specific operations but if those are too specific then they can't be used by different/newer model architectures. (Though it does make sense to try and optimize common operations/logic where possible.)

It would be interesting to see if these designs can/will benefit training as well, as that would bring down the time/cost/energy of training large models as well as making it easier for local fine-tuning.

ip26 12 hours ago | parent

A large fraction of the innovation in CPUs is driven by working around the memory wall. I anticipate AI inference will follow the same trend, and innovations that work around the autoregressive nature will be enormously impactful.

Speculative decoding is an example. An accurate draft model can reduce the number of times you stream through memory by a factor of 4x.

nixon_why69 4 hours ago | parent

Speculative decoding is software, though.

How do you work around the memory wall when you're going to have to stream all weights, no matter what? Latency-hiding tricks don't matter when you're bandwidth constrained.

searealist 2 hours ago | parent

2x is more typical, and only for dense models, not the sparse models all frontier labs use.

swimwiththebeat 8 hours ago | parent

> Tensordyne is expected to accelerate AI inference with a logarithmic number system that leans on a property of logarithms: The log of A times B equals the log of A plus the log of B. So, storing numbers as their exponents lets the chip add where it would otherwise multiply. That matters in silicon because multiplier circuits draw more power and use more die area than adders do. Tensordyne says its rack-scale hardware, called Napier, can produce up to 1,300 tokens per second per user, and can do so while using less than a tenth as much power as comparable Nvidia hardware.

Did not know about this cool trick about storing numbers as exponents! Is there a name for this technique? Wouldn’t there be overhead in converting back and forth between the exponent and the number?

gcr 8 hours ago | parent

hang on, isn't this the standard way to implement IEEE 754 floating-point multiply since forever?

normalize the two numbers A and B to have the same exponent, add the mantissa, then convert back to IEEE 754?

tasty_freeze 8 hours ago | parent

no. IEEE splits the power of two exponent from the base 2 mantissa. Yes, the exponents are added during a multiply, but the mantissas do an ordinary multiply.

The idea is rather than storing a number x as (exponent, mantissa), just store (log x) as a fixed precision number. Multiplying two such numbers is just addition, dividing is just subtraction. TBH I didn't read the article, but my reaction is that yes, that works, but one must sum all those products, and now summing becomes an expensive operation. Maybe the total cost saves area and power, but it beggars belief that it is 10x more efficient. They must be doing PR math: our low precision log scheme is 10x more efficient than a higher precision traditional approach.

Another thing to keep in mind is a lot of inference is done using very low precision math and so the cost of doing multiplies isn't that bad. Yes, it is still (n bits) squared, but as n gets small, n^2 still isn't too bad.

hgoel 7 hours ago | parent

Also I wonder how this affects the distribution and precision needed for storing the log weights compared to regular ones.

windenntw 16 minutes ago | parent

This is essentially the way many 8 bit games did 3d rendering ( for example the world famous Elite )... you just need two tables, one linear2log and another log2linear, with careful measurement of the ranges and number of elements needed in you application ( which is easy for inference ).

ps. Also used in the original circuits of the Yamaha DX7 synthetiser ( https://www.righto.com/2021/11/reverse-engineering-yamaha-dx... ).

vrighter 2 hours ago | parent

but aren't additions in exponents expensive? as in each operation is an fma