bijou64

Faster double-to-string conversion

There comes a time in every software engineer’s life when they come up with a new binary-to-decimal floating-point conversion method. I guess my time has come. I just wrote one, mostly over a weekend: https://github.com/vitaut/zmij.

Taelin on Twitter / X

aaand it is now 1280x fasterQuickSort is synthesized in 6 seconds now, in a single thread(down from 20 seconds with 256 threads!)that's by not matching accumulator arguments - which is wasteful. I implemented that in preparation for a "NeoGen Net" experiment. everything is… https://t.co/qdwkiQbRnI— Taelin (@VictorTaelin) April 13, 2025

Better bitmap performance with Roaring bitmaps

Bitmap indexes are commonly used in databases and search engines. By exploiting bit-level parallelism, they can significantly accelerate queries. However, they can use much memory, and thus we might prefer compressed bitmap indexes. Following Oracle's lead, bitmaps are often compressed using run-length encoding (RLE). Building on prior work, we introduce the Roaring compressed bitmap format: it uses packed arrays for compression instead of RLE. We compare it to two high-performance RLE-based bitmap encoding techniques: WAH (Word Aligned Hybrid compression scheme) and Concise (Compressed `n' Composable Integer Set). On synthetic and real data, we find that Roaring bitmaps (1) often compress significantly better (e.g., 2 times) and (2) are faster than the compressed alternatives (up to 900 times faster for intersections). Our results challenge the view that RLE-based bitmap compression is best.

duetosymmetry/bibretrieve

[Leo's fork of] BibRetrieve: An Emacs library for searching and downloading BibTeX entries from the web.

Brotli vulnerability (CVE-2026-111497) — Patch the Planet

Brotli decoder vulnerability: affected software, fixed releases, and how to disable Brotli decoding while you patch.

Consistently faster and smaller compressed bitmaps with Roaring | Daniel Lemire, Computer Science Professor

Computer Science Professor

A mystery with memory leaks and a magic number

Concise Binary Object Representation (CBOR)

The Concise Binary Object Representation (CBOR) is a data format whose design goals include the possibility of extremely small code size, fairly small message size, and extensibility without the need for version negotiation. These design goals make it different from earlier binary serializations such as ASN.1 and MessagePack. This document obsoletes RFC 7049, providing editorial improvements, new details, and errata fixes while keeping full compatibility with the interchange format of RFC 7049. It does not create a new version of the format.

io_uring for High-Performance DBMSs: When and How to Use It

language = C++, basicstyle = , keywordstyle = , keywordstyle = [2], morekeywords = [2]uint64_t, uint32_t, uint16_t, uint8_t, int64_t, int32_t, int16_t, int8_t, int, float, double, char, void, __m512i, __mmask16, __mmask8,

How to Make Your Tauri Dev Faster

A one-minute compile became fifteen seconds. Here's what was wrong and how to fix it.