Why BQN Wins

Lobsters Hottest Tools

Summary

The article presents a benchmark comparing BQN's performance for an odd binary function, highlighting its advantages with a live demonstration.

<p>All BQN solutions outperformed everything else in this <a href="https://www.youtube.com/watch?v=7n262KKvHj8" rel="ugc">perf wars</a> video, this file explains the optimizations BQN has which led it there.</p> <p><a href="https://lobste.rs/s/lqelb1/why_bqn_wins">Comments</a></p>
Original Article
View Cached Full Text

Cached at: 08/18/26, 02:13 AM

codereport/max-odd-binary

Source: https://github.com/codereport/max-odd-binary

🥳 LIVE BENCHMARK: HERE 🥳

benchmark_fast

Similar Articles

Bias Compounds, Variance Washes Out

Hacker News Top

This article demonstrates that using stochastic rounding for BF16 optimizer state can match FP32 performance because unbiased errors cancel over time, whereas round-to-nearest stalls due to compounding bias. An experiment with an MLP shows BF16+SR achieves similar loss to FP32 while using less memory.