mbitsnbites

13 ms·

1.
Show HN: A tool to capture video on one device, encode/store it on another one(codeberg.org)
1 points by mbitsnbites 2mo ago|0 comments
2.
by mbitsnbites 5mo ago
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 bypasses the preprocessor (like ccache but unlike sccac
3.
by mbitsnbites 5mo ago
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 make thousands of clobber builds every day in
4.
by mbitsnbites 5mo ago
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). Safari is popular because it ships with iOS and macOS. Edge
5.
by mbitsnbites 5mo ago
And a local cache (kind of level 1 and level 2 caches)
6.
How to make Firefox builds 17% faster(blog.farre.se)
204 points by mbitsnbites 5mo ago|37 comments
7.
by mbitsnbites 7mo ago
Just a note for the posterity: The continuation of the project is called Bitfrost CC and lives here: https://codeberg.org/mbitsnbites/bitfrostcc
8.
by mbitsnbites 7mo ago
Thanks for the references! After writing the blog I was looking for such references.
9.
by mbitsnbites 7mo ago
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 hidden agenda is to create a low-latency codec that can
10.
by mbitsnbites 7mo ago
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 the latter is quite overwhelming, while the former took
11.
Show HN: A luma dependent chroma compression algorithm (image compression)(bitsnbites.eu)
59 points by mbitsnbites 8mo ago|13 comments
12.
Calculate time to crack a cryptographic key (web tool)(bruteforce.bitsnbites.eu)
1 points by mbitsnbites 1y ago|0 comments
13.
by mbitsnbites 2y ago
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 7600 (with excellent performance BTW), so it looks like it sh
14.
by mbitsnbites 2y ago
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 "only" 2^23 numbers, so perfectly doable. My se
15.
by mbitsnbites 2y ago
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.30728 bits) Error avg: 0.0327344845327 (4
16.
by mbitsnbites 2y ago
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's for the Newton-Raphson steps, or Goldschmidt steps. I
17.
by mbitsnbites 2y ago
We have memcpy behind a C++ template function that mimics the interface of std::bit_cast.
18.
by mbitsnbites 2y ago
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.
19.
by mbitsnbites 2y ago
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) onto it. If it's a CPU then you can add special
20.
by mbitsnbites 2y ago
Excellent! Will have a look.
21.
by mbitsnbites 2y ago
There is also the case with machines that lack FP support, like some ARM Cortex M variants.
22.
by mbitsnbites 2y ago
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 endianity is not the same as integer endianity. * Floating-
23.
by mbitsnbites 2y ago
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 precision, you need to do three Newton-Raphson iterations after t
24.
Reciprocal Approximation with 1 Subtraction
99 points by mbitsnbites 2y ago|69 comments
25.
Quake 2 on an FPGA (MRISC32 CPU) [video](vimeo.com)
2 points by mbitsnbites 2y ago|0 comments
26.
by mbitsnbites 2y ago
I'd argue that x86 and IBM z/Arch are the ones that stick out among contemporary ISAs in that they need fairly complex fron-end translation into an internal instruction format. ARM implementations that support both ARMv7 (both ARM
27.
by mbitsnbites 2y ago
People are ignorant. Companies are greedy. That's why we need regulation. Children don't need social media, just as they don't need tobacco or alcohol. As long as all your friends are off social media, you'll be fine.
28.
by mbitsnbites 3y ago
Yup. Everything pre-RISC was CPI (Cray doesn't count - it was effectively RISC, and way too expensive anyway).
29.
by mbitsnbites 3y ago
> government doing a parent's job The problem here is that it's pretty much out of the hands of the parents. If your kids' friends have social media, your kids will absolutely need it too in order to not be left out. I&#x2
30.
by mbitsnbites 3y ago
> I'd like to see more science proving that social media is bad for kids Smoking tobacco was allowed for children for hundreds of years before it was regulated. Today we can hardly fathom how stupid it would be to allow children to

More ›