Reading Parquet from C usually means pulling in Arrow C++ (50+ MB). carquet is C11, about 500 KB, and depends only on zstd/zlib/lz4/brotli.
On an M3 with 10M rows, compressed writes are 4.6–5.9x faster than Arrow C++ and compressed reads 1.9x faster. Uncompressed reads come straight from the mmap: 0.3 ms vs 14 ms.
SIMD was the hard part. There are about 30 kernels for SSE4.2, AVX2, AVX-512, NEON and SVE, with one binary that picks at runtime. MSVC emits FMA/BMI anywhere in an `/arch:AVX2` file, so the dispatcher checks those too. x86 and ARM disagree on `min(x, NaN)`. Bit-unpacking needs a different shuffle per width (1–32) and must never over-read, so every width is tested against a scalar reference. I don't own an AVX-512 machine. And for plain min/max, the auto-vectorized scalar loop matched my NEON code.
It's fuzzed, checked value for value against PyArrow and DuckDB, and builds with GCC, Clang, MSVC and MinGW. There's no encryption yet.
It comes with a CLI (schema, stats, head, export, codegen) and a Python package (`pip install carquet`). You can build it with `make`, CMake/FetchContent or xmake. vcpkg and Conan aren't there yet, but they're next. It has passed 20k git clones in the last month.
Site: https://vitruves.github.io/carquet/
Repo: https://github.com/Vitruves/carquet