research 16 posts

← all posts · monogate.org

A Constructive Khovanskii Reduction

MachLib now ships a finite zero-count bound for polynomial-in-(x, eˣ), proven modulo an axiomatized analytic base. A Forge-emitted Butler-Volmer kernel obligation closes on top of it. Honest scope inside.

research

The Dashboard the Verification Needed

We shipped a constructive Khovanskii framework on MachLib, then built the CI dashboard the framework deserved. The dashboard caught us over-counting on its first run.

research

The EML Advantage Lab

A bounded research ledger for where EML helps, where protected standard math wins, and which claims remain blocked.

research

The First Proof-Carrying Rescue

A narrow Forge trace now demonstrates the Monogate stack's first end-to-end boundary rescue shape: raw domain-wall failure, log-domain lift, rescue packet, and MachLib positive-coordinate obligation.

research

The Fourth Proof-Carrying Rescue

Forge now has a saturation-deshelf packet: finite clamp-shelf collapse, pre-clamp pressure replay, boundary-structure recovery, and a MachLib clamp-invariant obligation.

research

How to Read the Rescue Suite

A practical guide to the proof-carrying rescue suite manifest: what the packets mean, what they prove, and what they deliberately do not claim.

research

Proof-Carrying Rescue Status

A compact status table for Monogate's boundary rescue operators: Forge evidence, MachLib bridge status, and publication state.

research

Proof-Carrying Rescue Suite v0

The Monogate boundary-event rescue suite now has four packet-backed lanes and a unified Forge manifest.

research

The Second Proof-Carrying Rescue

Forge now has a guard-clamp overflow rescue packet: raw overflow-wall failure, bounded guarded evaluation, guard-rescue transition, and MachLib output-safety obligation.

research

The Third Proof-Carrying Rescue

Forge now has a precision-escape packet for a finite phantom-attractor trace: low-precision stalling, higher-precision sensitivity, escape to an interior event, and a MachLib precision obligation.

research

Why EML Optimization Lives on the Boundary

High-dimensional volume collapse explains why EML tree search hits corners, log-domain cliffs, overflow walls, and phantom-attractor behavior. The Monogate stack now has Forge traces, IR evidence, and MachLib theorem targets for it.

research

The Equation That Counts Physics

Hand a damped-oscillator equation to a computer and it can tell you, without knowing any physics, that there's one oscillation and one decay inside it. Across 193 expressions and 12 domains, this counter holds at ρ = +0.885.

research

EML Generates the Exponential Mandelbrot Set

Iterating exp(z)−k is Devaney's exponential family. We computed 8 operator fractal zoos, measured box-counting dimensions, and found DEML/EMN generate bounded strange attractors.

research

Timbre Is EML Node Count

Each Fourier harmonic is one complex EML node. We measured timbre complexity for 5 instruments and found: Sine=1n, Clarinet=5n, Violin=12n. EXL is the most musically useful operator.

research

0.99999524: The Near-Miss

How close can an EML tree get to i? A gap of 4.76×10⁻⁶ and the transcendental obstruction via Lindemann–Weierstrass.

research