Viewing profile — mbitsnbites

Same with BuildCache, except you also get a fast local cache so you effectively have an L1 and an L2 cache. In fact, since you also have super fast "direct mode" caching that bypas…

Though I'm not actively working with Firefox so can't speak for their use cases, one important use case for clobber builds is CI. I'm the author of BuildCache, and where I work we …

For what it's worth, browser uptake is largely dictated by the browser being default shipped with some major OS. Very few users make an active choice (statistically speaking). Safa…

And a local cache (kind of level 1 and level 2 caches)

Just a note for the posterity: The continuation of the project is called Bitfrost CC and lives here: https://codeberg.org/mbitsnbites/bitfrostcc

Thanks for the references! After writing the blog I was looking for such references.

Thanks for the feedback, and the interesting ideas. It's good to know that I was on to something and not completely off :-) I'm mostly doing this for learning purposes, but a hidde…

I truly get that. That's also one of the reasons why I started from scratch once I got the idea, rather than researching all the available papers and implementations etc (because t…

The model is based on Qwen2.5-Coder-7b it seems. I currently run some quantized variant of Qwen2.5-Coder-7b locally with llama.cpp and it fits nicely in the 8GB VRAM of my Radeon 7…

When measuring the errors I exhaustively iterate over all possible floats in the range [1, 2), by enumerating all IEEE 754 single precision representations in that range. That's "o…

Given my search criteria, the optimal magic number turns out to be: 0x7ef311c2 Initial approximation: Good bits min: 4 Good bits avg: 5.242649912834 Error max: 0.0505102872849 (4.3…

The big cores do. They essentially pump division through something like an FMA (fused multiply-add) unit, possibly the same unit that is used for multiplication and addition. That'…

We have memcpy behind a C++ template function that mimics the interface of std::bit_cast.

Your suggestion got me intrigued. I have a program that does an exhaustive check for maximum and average error, so I'll give your numbers a spin.

If you're not constrained to software solutions you have a whole world of opportunities. E.g. if it's a graphics or neural net pipeline you can pour tricks like this (or better) on…

Excellent! Will have a look.

There is also the case with machines that lack FP support, like some ARM Cortex M variants.

The proper solution is to use std::bit_cast in modern C++ or otherwise use memcpy, and of course know what you're doing. Some things that could mess with you: * Floating-point endi…

Yep. Along the same lines. This one is even simpler, though, as it requires only a single integer CPU instruction (and the simplest of all instructions too). If you want full preci…

Today's find: You can get a floating-point approximation of 1/x that's accurate to 3 bits with a single integer subtraction instruction. float fast_reciprocal(float x) { unsigned i…