# A Communication Theory of Computation Realization Canonical: https://semiaifoundry.com/research/computation-realization-geometry/ Author: F. M. Cinnor Published: 2026-08-25 Revision: 2026-10-07 Rights: https://creativecommons.org/licenses/by/4.0/ Computation–Realization Geometry # A Communication Theory of Computation Realization A formal framework for preserving valid implementation choices before architecture becomes definitive—and for knowing when commitment is safe. By F. M. CinnorPublished August 2026Six-manuscript technical corpusTheory, evidence, and operational system The 55-year gap ## Optimization can improve the design space it receives. It cannot recover a valid path erased before search began. Modern computing systems combine compute dies, HBM stacks, advanced packages, high-speed links, power delivery, cooling, and rack-scale infrastructure. Choices about where computation lives, which state is stored or recomputed, how data moves, and where system boundaries fall can eliminate entire families of possible implementations. Since Rent’s rule entered the public literature in 1971, the field has developed powerful theories and tools for interconnection, memory traffic, performance, architecture exploration, and physical design. What remained missing was a general formal map of the valid realization choices that exist before one architecture becomes definitive. **$30M**65 nm design cost 2006 **\>$540M**5 nm design cost 2020 **\>18×**increase across fourteen years Source: [Semiconductor Industry Association ↗](https://www.semiconductors.org/policies/chip-design/) The framework ## Computation–Realization Geometry maps the valid ways a computation can become physical. CRG records the joint demands each realization places on movement, state, work, latency, replication, ownership, and hierarchy. It makes the options that precede architecture explicit enough to compare, preserve, and govern. 1. 01 **The computation** states what must remain true. 2. 02 **The rules** define which transformations and trades are valid. 3. 03 **The geometry** records what can be achieved jointly. 4. 04 **Technology** chooses last. ## Computation–Realization Geometry program map [![Computation–Realization Geometry program map showing how CRG preserves valid realization paths, applies the Safe-Commitment Law, and operationalizes certifiably safe decisions through CRG System.](https://semiaifoundry.com/assets/images/crg-program-map-v2.webp)](https://semiaifoundry.com/assets/images/crg-program-map-v2.webp) Safe-Commitment Law ## Discard an option only when the decisions still ahead could not tell that it was gone. CRG identifies what information must survive for a declared class of future decisions. When an option is removed too early, the framework can construct a concrete regret witness: a future decision showing exactly how that discarded option would have changed the outcome. From theory to an operational system ## The complete CRG program. The scientific record and operational system are distributed separately by design: one preserves the public research corpus, while the other provides a standalone and integrable vehicle for adoption. 01 / Theory ### Six-manuscript technical corpus The formal theory, extensions, proofs, and technical development of Computation–Realization Geometry. 02 / Evidence ### Public validation corpus Benchmarks, validation studies, negative controls, and reproducibility materials for independent inspection. 03 / System ### Operational realization control Software, documentation, verification tools, integration interfaces, and deployment packages that implement CRG in practice. CRG System registers valid implementation alternatives under declared rules, computes their joint obligations, preserves the geometry required by future decisions, incorporates changing technology and evidence, and issues auditable, independently verifiable certificates governing commitment and change. It is designed to sit alongside—not replace—compilers, optimization systems, EDA tools, physical simulators, laboratory systems, databases, and existing engineering workflows. Latest system milestone CRG Systems v1.5.0 September 2026 ## The commitment layer meets the agent. v1.5 closes the initial theory-to-platform arc with causal receipts, bounded coordination, canonical package resolution, execution contracts, generated clients, and an independently replayable agent boundary. [Read the v1.5 announcement](https://semiaifoundry.com/updates/the-commitment-layer-for-ai-native-chip-design/) The manuscript corpus · v3.2.0 ## Six manuscripts. One research program. From foundational interface laws to architecture selection, structural theorems, and a declared Transformer case study. 01 Canonical theory ### A Communication Theory of Computation Realization Resource-Conditioned Geometry of Legal Realizations and the Safe-Commitment Law August 24, 2026PDF · 2.5 MB [Read PDF](https://semiaifoundry.com/assets/research/crg/A_Communication_Theory_of_Computation_Realization_v3.2.0.pdf)[BibTeX](https://semiaifoundry.com/assets/research/crg/crg-canonical-theory.bib)[DOI](https://doi.org/10.5281/zenodo.22048090) Abstract A computation specifies a semantic relation, not one inevitable algorithm, hierarchy, architecture, or physical implementation. This article introduces Computation–Realization Geometry (CRG), a computation-first theory of the legal ways a declared computation can become physical. A computation and resource contract define a hierarchy-indexed realization family P; typed signature maps produce the exact attainable region R, the upper obligation region Γ visible to continuous monotone resource decisions, and the convex upper body K visible to additive nonnegative prices. The Safe-Commitment Law gives necessary and sufficient conditions for a retained realization family to preserve every decision in either declared class. A strict engineering-cost separation corollary constructs a continuous, coordinatewise strictly increasing, coercive regret witness whenever the required geometry is lost. The theory assembles contextual-state, hierarchy, and circuit–protocol constructions from established residual- state and communication-complexity arguments; establishes an exact interactive directional cut-rank orthant for finite-field linear computations; identifies deterministic carrier realizations with zero-error network function computation under matched contracts; and adapts convex support duality, temporal cut-state conservation, regular variation, positive-system contraction, and semialgebraic phase analysis to typed computation realizations. It reclassifies Rent-like laws as outputs of a declared realization, hierarchy, accounting convention, estimator, and fitting window. Technology is applied after legality and attainability, yielding a formal distinction between repricing an unchanged realization family and reopening it when capability or legality changes. The framework is carried through matrix multiplication, exact attention, layout conversion, a complete evaluation within a declared finite Transformer registry and typed exclusions, a graph-to-certificate reference representation, a controlled retention experiment, and compact routed 2.5D/3D realizations. The work supplies a unified abstraction layer linking semantic obligation, legal realization, decision-sufficient retention, scaling, architecture selection, and physical evidence. 02 Foundations ### Computation-Realization Geometry Semantic Interface Laws, Decision-Sufficient Abstraction, and Cost Duality August 25, 2026PDF · 0.8 MB [Read PDF](https://semiaifoundry.com/assets/research/crg/Computation_Realization_Geometry_Foundations_v3.2.0.pdf)[BibTeX](https://semiaifoundry.com/assets/research/crg/crg-foundations.bib)[DOI](https://doi.org/10.5281/zenodo.22050676) Abstract This paper introduces the foundational object of Computation–Realization Geometry (CRG). A terminalized computation and resource contract define a legal realization family P; typed signatures yield the exact attainable region R, the upper obligation region Γ, and the additive-price-visible body K. Contextual equivalence gives canonical directed interface states in the declared tree model, while circuit–protocol translations and interactive examples show why realization identity must remain distinct from a resource image. Monotone reconstruction and nonnegative support duality identify Γ and K as exact decision-sufficient quotients for their respective objective classes. The Safe-Commitment Law characterizes, in both directions, when a retained family preserves every declared future decision and supplies an explicit regret witness when it does not. A strict engineering-cost separation corollary strengthens the necessity direction to continuous, coordinatewise strictly increasing, coercive costs. The paper also develops hierarchy coherence, resource monotonicity, products, local data processing, and communication synergy. 03 Scaling ### A Generalized Rent Law from Computation-Realization Geometry Scaling Fixed Points, Hierarchy Phase, and Finite-Scale Diagnostics August 25, 2026PDF · 1.4 MB [Read PDF](https://semiaifoundry.com/assets/research/crg/A_Generalized_Rent_Law_from_Computation_Realization_Geometry_v3.2.0.pdf)[BibTeX](https://semiaifoundry.com/assets/research/crg/crg-scaling.bib)[DOI](https://doi.org/10.5281/zenodo.22050605) Abstract This paper develops a conditioned scaling theory for Computation–Realization Geometry. A Rent-like profile is defined as the multiscale observation of one legal realization under a declared hierarchy, accounting convention, estimator, and fit window. Stable dilation limits yield regular variation; preferred digital dilations permit periodic hierarchy phase; phase-ratio limits characterize power–slow-variation–phase decompositions; and positive periodic recursions with vanishing relative perturbations yield Perron–Floquet direction cycles. For heterogeneous modes, the local slope is a traffic-weighted mean and its curvature separates between-mode slope variance from within-mode drift. Interface reach, boundary caps, finite-window bias, concentration, and demand–service scale matching are derived within the same framework. Registered public-netlist diagnostics demonstrate hierarchy and estimator sensitivity, exactly close the declared same-hierarchy accounting identity as a software consistency check, and show nontrivial cross-hierarchy transfer failure. The result reclassifies a Rent exponent from a portable intrinsic scalar to a conditioned observation of a larger realization geometry. 04 Design ### Designing with Computation-Realization Geometry Certified Architecture Selection, Technology Matching, and Reference Physical Realization August 25, 2026PDF · 1.4 MB [Read PDF](https://semiaifoundry.com/assets/research/crg/Designing_with_Computation_Realization_Geometry_v3.2.0.pdf)[BibTeX](https://semiaifoundry.com/assets/research/crg/crg-design.bib)[DOI](https://doi.org/10.5281/zenodo.22050638) Abstract This paper develops the design calculus of Computation–Realization Geometry. Technology enters after computation, legality, and attainability through feasible embeddings, service laws, and declared objectives. Finite algebraic registries induce semialgebraic technology phase cells with stable feasibility, active bottlenecks, class winners, ties, and margins. Inner constructive witnesses and scope-matched outer obligations form certified brackets and permit safe pruning. Argmin-hitting characterizes exact retention over a finite technology ledger, while price changes, embedding changes, and capability changes induce distinct reprice, re-embed, and reopen actions. The theory is connected to physical link count, serialization, energy, power, and shoreline laws; matrix multiplication, exact attention, state sharing, and ownership conversion; a working graph-to-certificate representation; and compact routed 2.5D/3D realizations. Computational-complexity limits of exact phase decomposition and minimum-cardinality ledger retention are stated explicitly. The resulting design discipline carries a selected realization together with its witnesses, bounds, margin, dependencies, and reopen conditions. 05 Structural theorems ### Structural Theorems for Computation-Realization Geometry Interaction, Safe Commitment, Network Embedding, Conservation, and Scaling August 25, 2026PDF · 0.6 MB [Read PDF](https://semiaifoundry.com/assets/research/crg/Structural_Theorems_for_Computation_Realization_Geometry_v3.2.0.pdf)[BibTeX](https://semiaifoundry.com/assets/research/crg/crg-structural-theorems.bib)[DOI](https://doi.org/10.5281/zenodo.22050654) Abstract This paper develops selected exact deterministic fragments of Computation–Realization Geometry rather than claiming closure of the complete nonlinear, randomized, approximate, or physically embedded theory. It establishes circuit–protocol translations under named accounting rules, an exact interactive directional cut-rank orthant for finite-field linear computations, deterministic carrier/network-function-code equivalence, schedule- reachable temporal cut-state conservation, fractional certificate packing, hierarchy coherence, and exact retention statements for monotone and additive-price decision classes. The Safe-Commitment Law is supplemented by a strictly increasing coercive-cost separation result. Regular-variation, positive-system, boundary-collapse, and architecture–technology scaling theorems close additional declared slices. Each result keeps computation, ownership, legal transformations, hierarchy, accounting, and evidence class explicit, so theorems can be composed without transferring conclusions across incompatible contracts. 06 Case study ### Certified Nonseparable Co-Design of a Long-Context Transformer Superblock A Computation-Realization Geometry Case Study August 25, 2026PDF · 1.1 MB [Read PDF](https://semiaifoundry.com/assets/research/crg/Certified_Nonseparable_Transformer_Codesign_CRG_v3.2.0.pdf)[BibTeX](https://semiaifoundry.com/assets/research/crg/crg-transformer.bib)[DOI](https://doi.org/10.5281/zenodo.22058422) Abstract This paper presents a complete evaluation within a declared finite algebraic registry and typed exclusions for a long-context Transformer superblock. The registry distinguishes dedicated, universal time-shared, split-specialist, hybrid, memory-centric, and vertical realization classes under explicit state, traffic, execution, ownership, and technology contracts. Exact tensor-work equations, executed-pair policies, semantic bridge obligations, state aggregation laws, aligned-layout assignment, conserved timing, package-energy coordinates, integer allocation enumeration, technology phases, and context sensitivity are derived within that model. Standard, advanced 2.5D, and vertical technology contracts select different registered classes. A controlled follow-on retention experiment demonstrates decision-class-aware retention against winner-only and initial two-point Pareto reference policies, while compact routed 2.5D/3D models carry one semantic ownership boundary into physical timing, shoreline, area, temperature, test, yield, and reliability proxies. Exact decimal values identify the registered algebraic model; physical calibration and broader architecture coverage remain separate evidence questions. [Corpus citations](https://semiaifoundry.com/assets/research/crg/citations.bib)[File checksums](https://semiaifoundry.com/assets/research/crg/SHA256SUMS.txt)[CC BY 4.0](https://creativecommons.org/licenses/by/4.0/) Research record ## Theory, evidence, and implementation. [Canonical theory**A Communication Theory of Computation Realization****↗**](https://zenodo.org/records/22048090) [Publication record**Complete six-manuscript corpus****↗**](https://semiaifoundry.com/research/computation-realization-geometry/#manuscripts) [Research repository**Benchmarks, validation, and reproducibility****↗**](https://github.com/SemiAIFoundry/computation-realization-geometry) [System repository**CRG System software, documentation, and licensing****↗**](https://github.com/SemiAIFoundry/crg-systems) Contribution and accountability ## Human-led and AI-enabled. This work was human-led and human-accountable, with material research and engineering assistance from GPT‑5.6, Claude Fable 5, and coordinated AI systems. Those systems contributed to mathematical exploration, theorem formalization, implementation, verification, adversarial review, literature synthesis, and exposition. Human project leadership retained responsibility for research direction, acceptance or rejection of claims, validation standards, release decisions, licensing, and scientific accountability. [Read our Research in the Open commitment →](https://semiaifoundry.com/research/) Communication before commitment. Preserve the options the future may still need. [Read the release announcement →](https://semiaifoundry.com/updates/communication-theory-of-computation-realization/)