HDTP — Hourglass Data Teleportation Protocol — is a multi-stage data transit architecture that compresses arbitrary digital data into a structurally minimal form, transits it through narrow channels using a dedicated transit protocol, and reconstructs it bit-perfect at destination. Inspired by biological systems. Built solo. Filed and timestamped.
There are real-world conditions where the available channel is orders of magnitude narrower than the data that must move through it. Bandwidth-constrained IoT and edge devices. Disaster scenarios with degraded infrastructure. Side-channel transits that carry only a few bits at a time. In these conditions, conventional methods break down — not because they are poorly designed, but because each method addresses only a partial problem. None solves it end-to-end.
ZIP, GZIP, Brotli, Zstandard reduce file size by removing statistical redundancy. They are bounded by information-theoretic limits. A 10MB file compressed to 5MB still requires a 5MB-capable channel. They cannot reach the orders-of-magnitude reduction needed for bytes-per-second transit.
VPN, Tor, DNS tunneling wrap data inside permitted protocols. They do not fundamentally reduce data volume — they only change its visible form. Deep Packet Inspection can identify tunneled traffic through statistical analysis of size, timing, and volume.
Hiding data within carrier media (images, audio) is capacity-limited — typically less than five percent of the carrier. Statistical steganalysis can detect the presence of hidden data through entropy analysis. Useful in a narrow set of cases. Not a general transit method.
Briar, Bridgefy, and similar mesh approaches require user density and do not reduce message size. Each node carries a complete copy of the message — which creates a structural security vulnerability if any single node is compromised.
HDTP operates in three phases, inspired by biological information transfer. The source decomposes data into a structurally minimal transit form. The transit form passes through whatever narrow channel is available, using a dedicated transit protocol. At destination, a chain of nodes reconstructs the data bit-perfect — with no single node holding the complete data along the way.
Arbitrary input data — any type, any size — is decomposed through a multi-layer process into a transit form orders of magnitude smaller than the original. The decomposition is structural and semantic, not merely statistical. The specific algorithms that make this beyond-Shannon reduction possible are part of the reserved core of the invention.
The transit form moves through the narrowest available channel using a dedicated transit protocol. The protocol is designed to be channel-agnostic — it adapts to whatever physical medium can carry binary information at the available rate. The key architectural property: the transit form is small enough to fit through any channel that carries any information at all.
At destination, a chain of nodes reconstructs the data sequentially. Each node processes only its own assigned layer. No single node holds the complete data, knows the total chain length, or knows the identity of other nodes. The complete original data emerges only at the final node, bit-perfect, verified by cryptographic hash. The full sequential reconstruction logic is part of the reserved core.
Each individual property below exists somewhere in prior art. The combination — in a single coherent architecture — is what HDTP introduces. The table below compares HDTP against the four most common approaches on the five properties that matter for narrow-channel transit.
| Property | Compression (ZIP, Brotli) | Tunneling (VPN, Tor) | Steganography | Mesh networks | HDTP |
|---|---|---|---|---|---|
| Beyond-statistical-limit reduction | × | × | × | × | ✓ |
| Transit through arbitrary narrow channels | × | × | Partial | × | ✓ |
| Bit-perfect reconstruction | ✓ | ✓ | ✓ | ✓ | ✓ |
| No single node holds complete data | × | Partial | × | × | ✓ |
| Architectural security (not encryption-dependent) | × | × | × | × | ✓ |
HDTP applies to any condition where the available transit channel is smaller than the data that must pass through it. The protocol compresses data into its most reduced structural form, transits it through the narrowest available channel using a dedicated transit protocol, and reconstructs it bit-perfect at destination. The pattern generalizes across multiple domains.
LoRa, NB-IoT, satellite pagers, low-power sensors, and similar edge devices have extremely limited transit capacity. HDTP enables transmission of payload volumes that the channel could not otherwise carry — without requiring custom hardware or higher-bandwidth links.
When infrastructure is damaged and only minimal connectivity remains — a single satellite link, a degraded cellular signal, or a constrained backup channel — HDTP can transit complete data through whatever narrow channel still functions.
Because security is architectural — no single node holds complete data — HDTP retains its security properties even against quantum-class attacks that could break conventional cryptographic primitives. Architectural security supplements, rather than depends on, encryption strength.
For sensitive transit where compromise of any single node should not compromise the complete payload, HDTP's multi-node sequential processing provides inherent structural security. The complete data is reconstructable only by traversing the full chain in correct order.
HDTP follows the same layered disclosure structure as the rest of the MZN portfolio. What appears on this page and in the provisional patent specification establishes priority and is sufficient for strategic evaluation — but is intentionally insufficient for re-implementation. The core mechanisms that make the architecture work in practice are reserved for partnership-tier conversation, after alignment is established.
First disclosure is established through a combination of unique identifier, cryptographic hash, blockchain timestamp, and an AI-assisted documentation session whose conversation logs are preserved. Each artifact below can be verified independently, without trusting any single source.
HDTP is filed.
Priority is established.
The full architecture is reserved for the right partner.
This page presents what is appropriate for the public layer. The ~70% reserved — including the specific decomposition algorithms, the node intelligence layers, and the architectural layers beneath the visible surface — enters the conversation only with the selected partner, after confirmed alignment, in coordinated correspondence.