Skip to content
#edge computing Open access

The Margin Carry Law

Oct 2026 · Zenodo (CERN European Organization for Nuclear Research)
Systems Engineering Methodologies and Applications

Abstract

The Margin Carry Law A Falsifiable Cross-Octave Law for Structural Margin PreservationOctober 2026By Kevin L. Brown This paper addresses a restricted question. Given a system organized into adjacent scale levels — termed octaves, where each level is constructed from, and constrained by, the level below it — what lower bound can be stated for the structural margin that remains after transport from one level to the next? The paper proposes such a bound, states the conditions under which it is asserted, and specifies the criterion under which it is to be rejected. The structural margin δ_o at octave o is defined as the fraction of that level's capacity that remains uncommitted after the level's internal obligations are met. The Margin Carry Law consists of two clauses. Clause (i) bounds the margin at the receiving octave from below: δ_{o+1} ≥ δ_o · ρ_o, with ρ_o = m_o · A_{o+1} / (A_{o+1} + D_map,o), where m_o is the fraction of margin retained through the transport step, A_{o+1} is the intake total at the receiving octave, and D_map,o is the mapping-distortion term for the transition from octave o to octave o+1. Clause (ii) bounds the receiving octave's cumulative intake over its lifetime: Σ_n B_{o+1}(n) ≤ A_{o+1}, where B_{o+1}(n) is the intake drawn at turn n, summed over completed turns with the terminal partial turn included as specified in the paper. Under the stated definitions the carry factor satisfies ρ_o < 1, so the law does not permit transport to generate margin. Iterated over a chain of octaves, clause (i) yields a product bound: the margin at the terminal octave is bounded below by the initial margin multiplied by the carry factors of the individual transitions. The law is proposed, not proved. The paper distinguishes its contents by status throughout — derived, proposed, computed, and open — and asserts no universal transport theorem. A countermodel presented in the paper shows that the formation of a two-octave structure does not by itself imply clause (i), so the law is not a consequence of the definitions alone. Its falsification criterion (K-SCALE) is stated in advance: a built instance that satisfies the paper's stated conditions and whose receiving-octave margin falls below the carry floor falsifies the law within its stated domain. The supporting computation is a single built two-octave instance evaluated in exact rational arithmetic. In that instance the retention factor is m ≈ 0.959814, the required floor is δ_o · ρ_o ≈ 0.463014, and the receiving octave's margin is δ = 55311/114658 ≈ 0.482400, so clause (i) holds with a positive surplus of approximately 0.0194 over the floor. The instance value is a designated record value (record y′_S[MI-G-001], card MC-G-001, observation horizon N_obs = 3) and is reported together with the defining data on which it depends, including the formation threshold convention adopted in the paper. A verification script accompanies the record and recomputes the rational quantities reported for the instance, including the formation thresholds, the corrected intake shares, and the countermodel values. The principal limitation is stated explicitly. Flat channels — zero modes, directions along which a level carries no structure that the transport step can act on — are not resolved by the present construction. A computation reported in the paper gives near-misses of approximately 0.0063 against the floor in the zero-mode case; this computation is not a built counterexample and does not satisfy K-SCALE. The zero-mode case, multi-transition (multi-hop) tests, and positive-cost model instances are listed in the paper's open register. Status: a self-contained, falsifiable proposal with one built instance and a named open edge; independent checking and attempted falsification are the intended next steps. Keywords: scale transport; structural margin; cross-octave bounds; falsification criteria; exact rational arithmetic; iterated bounds; zero modes

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.