Skip to content
#edge computing Open access

Structured Pad Geometry: Multi-Channel Partitioning, Sequence-Indexed Addressing, and Pure-Tier Media over a Single One-Time Pad

Sep 2026 · Zenodo (CERN European Organization for Nuclear Research)

Abstract

A shared one-time pad is conventionally treated as a single linear byte stream consumed front to back, one message after another. This wastes the pad's structural potential, forces a single serialised channel, and leaves the pad's most dangerous failure — reuse of bytes across two messages — as a discipline the implementer must never once violate. It also makes reception fragile: a running receive cursor desynchronises permanently the first time a message is lost, reordered, or duplicated, which on a public relay is the normal case rather than an edge case. We present a complete organising layer for a single pad, in three parts that turn out to be one design. First, a deterministic geometry: the pad is partitioned into typed, direction-split channels plus a reserve used only to derive rendezvous identifiers, as a pure function of pad length and endpoint role, so both sides compute identical layouts with no negotiation, and boundary guards convert reuse prevention from a runtime discipline into a structural invariant. Second, sequence-indexed addressing: each message's pad offset is a pure function of its sequence number rather than of the receiver's history, and a look-ahead window of expected identifiers replaces a single "next" identifier, so any message opens independently of whether its predecessors arrived. Third, pure-tier media: because the geometry provides typed zones and the addressing provides out-of-order opening, images and voice can be carried at the same information-theoretic tier as text via a sealed manifest-and-blob pair, with media type, ephemerality flag, and blob coordinates all sealed. We give the layout function, the addressing scheme, a desync-immunity argument, the media construction, exact capacity semantics, and the honest costs of each. Keywords: one-time pad, keystream management, two-time-pad prevention, reorder tolerance, length hiding, metadata hiding, perfect secrecy, media encryption. ---

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.