performance
- BitCrafts ToolkitSet of C11 libraries and CLI tools — parallel hashing, duplicate detection, file integrity manifests. Zero external runtime dependencies, GPLv3 (tools) / LGPLv3 (libraries). Lives in the bit-crafts monorepo on GitHub.
- Introducing bit-crafts: a C11 monorepo for fast file inspection on Linux6 libraries, 3 tools, one C11 monorepo: bcduplicate finds duplicates at 758k files/s — 18× faster than rmlint on the same thread count.
- parallel-walk-plus-process: the pattern behind bc-hash and bc-duplicateWhy find | xargs -P plateaus at scale, and how three phases separated by a strict barrier — parallel walk, sequential merge, parallel process — take a recursive hash from 12s to 7s on 650k files.
- bc-duplicate: three passes to find duplicates without reading 99 % of the filesFind duplicates among a million files in 3.7 seconds: a size → fast-hash → full-hash pipeline, io_uring, and adaptive dispatch. Numbers, architecture, and what the hash choice actually changes.
- The 4 allocators every C developer should knowBump, pool, free-list, arena — four C allocators to replace malloc where it counts. Principle, use case, and minimal code for each.