BitPads Protocol v2.0 · BitLedger v3.0 · Universal Domain v1.0
One Byte
to One Record
From a single heartbeat byte to a fully identified, timestamped, valued, tasked civilisational record — in as few as one byte.
BitPads is the outermost layer of a binary protocol family built from first principles at the mathematical foundation of information exchange. A single Meta byte declares everything that follows before the receiver processes a single payload bit.
Every transmission begins with the same byte. The receiver reads it and knows the type, content, enhancement state, and fragment status. The common case — a Pure Signal — costs exactly one byte. Complexity attaches on demand, at exact cost proportional to what it expresses. Nothing else inflates the wire.
Minimum Transmission
The Pure Signal
When Meta byte 1 is transmitted alone, the transmission closes immediately. The entire message is in eight bits. No session required. No preamble. No schema lookup.
0x40 = 0100 0000 — Wave mode, ACK request, complete, basic treatment, no flags.
Meaning: I am here. Acknowledge me. Response: ACK control record 0x31.
Mode
Req
None
Treat.
Flags
A second pure signal: 0x0F = 0000 1111 — Wave, no ACK, complete, category mode, Priority Alert (1111). Meaning: priority alert incoming, receiver enters elevated mode.
Architecture
The Transmission Spectrum
Four frame types share one Meta byte architecture. Every transmission begins with the same byte. The receiver determines type, enhancement state, and fragment status from that single byte before processing payload. Size and capability attach on demand.
Document Family
Five Specifications
The BitPads protocol family is defined across five documents. The wire format authority is BitLedger v3. BitPads v2 wraps it. The Enhancement Sub-Protocol extends it. The Universal Domain generalises it. The Compound Mode Design Note documents a critical architectural decision and its tradeoffs.
Meta bytes 1 & 2, Wave and Record modes, 16 Wave categories, component sequence, decoder state machine. One byte to forty-four.
Industrial-strength signalling. Categories 1100, 1101, 1110. Binary pictography. Rolling codebook. Parser stack. 29+4 agreed C0 controls.
Binary-native financial protocol. Every bit carries defined meaning. Three independent error detection layers per 40-bit record. CRC-15 session integrity.
The same 40-bit record carries kilograms, watt-hours, data packets, and obligations. 16 universal flow archetypes. Wire format byte-for-byte identical to financial mode.
The 1111 continuation marker links records into one logical event. Documents the session-level compound flag, per-batch ceiling, and the v2 architectural tradeoff.
Architecture
Design Principles
No field in any layer is zero-padded or structurally unused. Reserved bits transmit as 1 to prevent zeroed trailing bytes. The protocol contains no waste by construction.
System bytes carry only invariant, load-bearing logic. Everything else is a module. Signal slots, Setup bytes, Time blocks, Task components — zero cost when absent.
The most common transaction uses 40 bits with no extension bytes. Complexity attaches on demand. The 4-byte anonymous Wave and the 44-byte fully-specified Record share the same Meta byte architecture.
Double-entry rules enforced by cross-layer flag redundancy. Mismatches are protocol errors. Three independent error detectors per 40-bit record. No separate checksum field required.
SOH leading 1-bit triggers protocol without preamble or sync sequence. In IDLE state, byte 0x01 unconditionally opens Layer 1 read. The sole context-free signal in the protocol.
All layers are exact multiples of 8 bits. No layer ends with trailing zero bits. Every byte boundary is intentional. The encoding is clean at every level of abstraction.
First Principles
The Conservation Invariant
Every meaningful exchange of value between entities is a conservation law. BitLedger encodes this invariant at the wire level, not the application level.
Double-entry accounting is not a bookkeeping convention — it is a conservation law. Every transaction records a quantity leaving one account and arriving at another. The sum of all signed flows in any valid set of entries is zero. This is the same algebraic invariant that governs current flow in electrical networks, mass balance in chemical processes, and momentum transfer in mechanical systems.
Sum of all currents
entering a node equals
sum of all leaving.
Electrical networks.
∑(+Vi) + ∑(−Vi) = 0
Same invariant applied
to monetary quantities.
Venetian merchants, 1494.
(mod precision step)
Enforced at the wire level
before the application
processes a single record.
These three statements are the same conservation principle expressed in different domains. Any system governed by a conservation law is therefore a natural candidate for BitLedger records — not as an approximation, but as an exact fit. The wire format does not change across domains. What changes is the semantic interpretation of two fields: the 4-bit relationship matrix and the 6-bit quantity type code.
Universal Domain consequence: The same 40-bit record that encodes a financial transaction encodes 450 kg of propellant flowing from Tank Assembly to Main Engine Thruster Array — because both are applications of the same conservation law. A satellite constellation settling power debts between nodes is doing double-entry accounting on watt-hours.
Design Heritage
5,000 Years of Communication
The first accounting systems used compact marks whose meaning expanded through shared context. The mark was minimal; the codebook was in the reader's knowledge. BitPads Binary Pictography is this principle implemented in nibble streams: four bits per symbol, sixteen semantic concepts per codebook, richness held in shared context.
The atom of binary communication. Every standard that followed — Murray, ASCII, ISO 6429, Unicode — preserved the 5-bit C0 space and left the three upper bits structurally available. 155 years of protocol evolution never claimed them. BitPads Enhancement Grammar reclaims all three as a universal flag matrix: Priority, Acknowledge Request, Continuation.
Formalised what Venetian merchants already practised: every transaction has two sides and the sides must balance. BitLedger enforces this invariant at the encoding level. The conservation law is structural, not procedural — a corrupt record that violates the invariant is rejected before it reaches the application.
The sum of currents at any node equals zero. Structurally identical to double-entry balance. BitLedger's Universal Domain recognises this explicitly: financial accounting and physical conservation are the same algebra applied to different quantities. The protocol enforces both with the same 40 bits.
One protocol family. Five documents. A complete binary transmission standard from Pure Signal to fully annotated civilisational record. Conservation enforced at the wire. Every bit earns its position. From deep-space telemetry to high-frequency industrial control without format changes.
At a Glance
Protocol by the Numbers
A complete transmission. The Pure Signal is a single Meta byte. The byte is the message.
A complete double-entry accounting record. Both sides, full classification, direction, status, value.
P1 through P13 spanning session, batch, record, and stream boundaries. Enhancement C0 bytes at declared positions.
Universal relationship types for any canonical flow between any two entities in any engineered system.
Maximum expressible value in a single 40-bit BitLedger record. ~305× global GDP. At D=2, SF×1B.
Flat 32-bit space. 3-level split: 255 networks × 255 systems × 65,535 nodes — 4.2B addressable sub-nodes.
CRC-15 detects all burst errors ≤15 bits. All single-bit, double-bit, and odd-count errors. 99.997% above 15 bits.
Compared to ~80,000 bytes in JSON. Reduction is structural, not compressive. No decompression step.
Format Comparison
100 Transactions — Wire Size
The reduction is structural, not compressive. No decompression step. No schema lookup. Fixed bit positions. The decoder reads and the record is decoded.