Research-Stack/0-Core-Formalism/otom
allaun 00e9eed399 fix(lean): complete projectionOrdering proof in GeometricCompressionWorkspace
Replace the TODO(lean-port) sorry with a complete proof of the
projectionOrdering theorem: for positive SourceValue pairs s1 < s2
with s2 ≤ maxExpected, projectToCoding preserves strict ordering
of the Q0_64 values.

The proof uses Nat-only arithmetic (no Float) and handles two cases:
  - a2 < d: both values fit in Q0_64 range, ordering follows from
    monotonicity of integer division
  - a2 = d: a2*s/d = s clamped to q0_64MaxRaw; a1*s/d < q0_64MaxRaw
    via the key inequality (d-1)*s < (s-1)*d

Build: 8598 jobs, 0 errors (lake build)
2026-06-18 15:06:50 -05:00
..
.github/workflows initial: sovereign research stack (consolidated, weightless, and lfs-optimized) 2026-05-04 18:11:36 -05:00
data Add selection metrics synthetic fixture 2026-05-05 13:22:32 -05:00
docs fix(lean): complete projectionOrdering proof in GeometricCompressionWorkspace 2026-06-18 15:06:50 -05:00
formal/lean/SidonAudit initial: sovereign research stack (consolidated, weightless, and lfs-optimized) 2026-05-04 18:11:36 -05:00
hardware/verilog/core initial: sovereign research stack (consolidated, weightless, and lfs-optimized) 2026-05-04 18:11:36 -05:00
prototypes/webgpu-lean-ontology initial: sovereign research stack (consolidated, weightless, and lfs-optimized) 2026-05-04 18:11:36 -05:00
specs initial: sovereign research stack (consolidated, weightless, and lfs-optimized) 2026-05-04 18:11:36 -05:00
tools/lean/Semantics Remove legacy Python prototypes superseded by Lean formalization 2026-05-19 15:34:17 +00:00
CITATION.cff initial: sovereign research stack (consolidated, weightless, and lfs-optimized) 2026-05-04 18:11:36 -05:00
README.md fix(lean): complete projectionOrdering proof in GeometricCompressionWorkspace 2026-06-18 15:06:50 -05:00

OTOM — Ordered Transformation & Orchestration Model

OTOM is the canonical GitHub seed repository for the Research Stack: a Lean-first system for information theory, compression, graph/torsion routing, neural/manifold semantics, infrastructure shims, and hardware extraction targets.

Grounding axioms

  1. Lean is the source of truth. Python, Rust, Verilog, GraphML, Mermaid, and UI surfaces are extraction targets or projections.
  2. Publishing pipeline: Substrate / ENE ↔ Surface / Notion ↔ Intent / Linear ⟹ Metatype.
  3. Settlement lifecycle: SEED → FORMING → STABLE → CRYSTALLIZED → COMPRESSED.

Authority rule

Lean / Graph.lean      = canonical structure and proof authority
GraphML               = transport format
Mermaid               = static projection
Ace Knowledge Graph   = interactive projection only
Notion                = semantic registry / spec source
Linear                = task graph
Airtable              = operational mirror if connected later
Consensus             = literature context, not proof
GitHub                = code/provenance surface once seeded

Nothing updates canonical memory directly. Every item must become an artifact first:

artifact → fingerprint → route → outcome → memory

Placement tuple

All promoted artifacts use:

Project → Domain → Type → Settlement State

See docs/plumbing/PROJECT_DOMAIN_TYPE_MAP.md.

Current bootstrap docs

Canonical Lean entry

tools/lean/Semantics/Semantics/Constitution.lean

Repository status

This repo is being seeded from connected-source audit results. Treat current modules as FORMING until lake build and proof obligations are wired into CI.