Documentation Index
Fetch the complete documentation index at: https://docs.bitfield.so/llms.txt
Use this file to discover all available pages before exploring further.
Proof
How Bitfield is this fast.
Durable does not mean every read waits for storage hardware. Local does not mean fake. Fast claims only mean something when the measured category is visible.
The short version
Bitfield is fast because the storage shape removes work from the read path. Durable data means the data survives a crash or restart. Warm local read means the needed local file pages are already available and Bitfield knows where to read.Durable does not mean every read waits for disk
A memory map connects a durable local file to the program reading it. The operating system lets Bitfield touch local file pages like memory. The file is still the durable thing.When the operating system already has the needed pages warm, Bitfield can read known local bytes without sending a request to a separate database process.If the page is cold and hardware has to fetch it, physics is slower. That is why the honest wording is durable data with a warm local read path.Content addresses remove a kind of searching
Most database reads start by asking another database process a question. That process parses the question, plans the work, checks indexes, walks structures, and sends the answer back.Bitfield stores content by identity. Content identity means bytes can be named by what they are. Once Bitfield knows the local bytes to read, the warm local read path has much less work to do.No benchmark gets to hide its category
This is not a promise that a cold disk read takes less than a nanosecond. It is not a claim that a network round trip disappears. It is not saying every vendor benchmark is comparable to every other one.The rule is simple: show the mechanism, show the tradeoff, and say what work is actually being measured.
Next: read Storage shape for the public mechanism model, then read Warm and cold paths for the benchmark categories.