<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Monogate — Research Blog</title>
    <link>https://monogate.org</link>
    <description>Monogate Research: one operator for all elementary functions. Blog posts on SuperBEST routing, ELC characterisation, Lean-verified theorems, and the EML framework.</description>
    <language>en-us</language>
    <lastBuildDate>Fri, 01 May 2026 20:47:58 GMT</lastBuildDate>
    <atom:link href="https://monogate.org/rss.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>One Operator, All of Applied Mathematics</title>
      <link>https://monogate.org/blog/one-operator</link>
      <guid>https://monogate.org/blog/one-operator</guid>
      <pubDate>Mon, 27 Apr 2026 00:00:00 GMT</pubDate>
      <description>The NAND gate of continuous math. A single binary operation eml(x, y) = exp(x) − ln(y) generates every elementary function — and the structural fingerprint of an expression turns out to predict where it came from.</description>
    </item>
    <item>
      <title>Hear the Math: When Equations Become Sound</title>
      <link>https://monogate.org/blog/hear-the-math</link>
      <guid>https://monogate.org/blog/hear-the-math</guid>
      <pubDate>Mon, 27 Apr 2026 00:00:00 GMT</pubDate>
      <description>The best-selling synthesizer in history runs on a Bessel function. The Gibbs phenomenon&apos;s 9% overshoot is a theorem you can hear. Three interactive demos at 1op.io let you turn structural complexity into sound.</description>
    </item>
    <item>
      <title>The Equation That Counts Physics</title>
      <link>https://monogate.org/blog/dynamics-counter</link>
      <guid>https://monogate.org/blog/dynamics-counter</guid>
      <pubDate>Mon, 27 Apr 2026 00:00:00 GMT</pubDate>
      <description>Hand a damped-oscillator equation to a computer and it can tell you, without knowing any physics, that there&apos;s one oscillation and one decay inside it. Across 193 expressions and 12 domains, this counter holds at ρ = +0.885.</description>
    </item>
    <item>
      <title>How Claude and I Built a Research Program in Two Weeks</title>
      <link>https://monogate.org/blog/built-with-claude</link>
      <guid>https://monogate.org/blog/built-with-claude</guid>
      <pubDate>Mon, 27 Apr 2026 00:00:00 GMT</pubDate>
      <description>578 expressions, 50 Lean theorems, 5 PyPI packages, an npm port, a HuggingFace dataset, three websites, four interactive demos. Two weeks. One human. Here&apos;s what actually worked, what failed, and what the audit system caught before it reached the public.</description>
    </item>
    <item>
      <title>Which Way Does the Transform Go?</title>
      <link>https://monogate.org/blog/which-way-does-the-transform-go</link>
      <guid>https://monogate.org/blog/which-way-does-the-transform-go</guid>
      <pubDate>Thu, 23 Apr 2026 00:00:00 GMT</pubDate>
      <description>Classical integral transforms partition into three ELC-direction classes. The direction is determined by the kernel.</description>
    </item>
    <item>
      <title>What We Got Wrong</title>
      <link>https://monogate.org/blog/what-we-got-wrong</link>
      <guid>https://monogate.org/blog/what-we-got-wrong</guid>
      <pubDate>Thu, 23 Apr 2026 00:00:00 GMT</pubDate>
      <description>Four things we retracted, corrected, or demoted during the 2026-04 foundation audit. What survived is stronger for it.</description>
    </item>
    <item>
      <title>Two Boundaries of ELC</title>
      <link>https://monogate.org/blog/two-boundaries</link>
      <guid>https://monogate.org/blog/two-boundaries</guid>
      <pubDate>Thu, 23 Apr 2026 00:00:00 GMT</pubDate>
      <description>The elementary logarithmic closure is bounded by two structurally independent obstructions. Classical analysis guards one edge; classical algebra guards the other.</description>
    </item>
    <item>
      <title>Planck Radiation Is ELC-Native (No Trig Needed)</title>
      <link>https://monogate.org/blog/planck-elc-native</link>
      <guid>https://monogate.org/blog/planck-elc-native</guid>
      <pubDate>Thu, 23 Apr 2026 00:00:00 GMT</pubDate>
      <description>Six canonical electromagnetic formulas costed in F16 nodes. Planck&apos;s radiation law sits entirely inside the exp-log closure — unlike wave equations, which must cross to complex EML for cos. A double-angle identity inflates cost.</description>
    </item>
    <item>
      <title>The Oscillation Boundary</title>
      <link>https://monogate.org/blog/oscillation-boundary</link>
      <guid>https://monogate.org/blog/oscillation-boundary</guid>
      <pubDate>Thu, 23 Apr 2026 00:00:00 GMT</pubDate>
      <description>Across 315 tested equations, a clean dichotomy: oscillatory functions sit outside ELC with one exception — a non-elementary token.</description>
    </item>
    <item>
      <title>When Olympiad Problems Produce EML Trees</title>
      <link>https://monogate.org/blog/olympiad-meets-eml</link>
      <guid>https://monogate.org/blog/olympiad-meets-eml</guid>
      <pubDate>Thu, 23 Apr 2026 00:00:00 GMT</pubDate>
      <description>Classical functional equations characterise exp and ln, and their solutions turn out to be minimal EML trees — often cheaper than the equations that define them.</description>
    </item>
    <item>
      <title>FMA Is the Only Primitive That Matters</title>
      <link>https://monogate.org/blog/fma-staircase</link>
      <guid>https://monogate.org/blog/fma-staircase</guid>
      <pubDate>Thu, 23 Apr 2026 00:00:00 GMT</pubDate>
      <description>We measured the node-cost decay across seven basis states on 222 elementary-function equations. One primitive dominates: fused-multiply-add.</description>
    </item>
    <item>
      <title>Why EAL and EXL Share the Multiplier 4.3164206…</title>
      <link>https://monogate.org/blog/conjugacy-explained</link>
      <guid>https://monogate.org/blog/conjugacy-explained</guid>
      <pubDate>Thu, 23 Apr 2026 00:00:00 GMT</pubDate>
      <description>The EAL self-map and the EXL self-map have completely different fixed points, yet both have derivative exactly 4.3164206… at those points. The answer is a one-line topological conjugacy via exp.</description>
    </item>
    <item>
      <title>Only the Multiplicative F16 Operators Are Chaotic</title>
      <link>https://monogate.org/blog/chaos-multiplicative-operators</link>
      <guid>https://monogate.org/blog/chaos-multiplicative-operators</guid>
      <pubDate>Thu, 23 Apr 2026 00:00:00 GMT</pubDate>
      <description>A 600-point parameter sweep across all 16 F16 operators shows that 12 of them collapse to period-2 dynamics, while the four multiplicative operators (EXL, DEXL, EXN, DEXN) exhibit long cycles, chaos, and a period-3 Sharkovskii signature.</description>
    </item>
    <item>
      <title>The ReLU–Softplus Error is Exactly ln(2)/β</title>
      <link>https://monogate.org/blog/relu-softplus-exact-error</link>
      <guid>https://monogate.org/blog/relu-softplus-exact-error</guid>
      <pubDate>Wed, 22 Apr 2026 00:00:00 GMT</pubDate>
      <description>How much accuracy you lose by approximating ReLU with the smooth softplus activation — to three decimals, this is a clean closed-form constant.</description>
    </item>
    <item>
      <title>Every Log Branch Has Its Own Attractor</title>
      <link>https://monogate.org/blog/lambert-log-branch-attractors</link>
      <guid>https://monogate.org/blog/lambert-log-branch-attractors</guid>
      <pubDate>Wed, 22 Apr 2026 00:00:00 GMT</pubDate>
      <description>Iterate principal log on any seed in ℂ and you land at 0.318 + 1.337i. Use the k-th branch and you land somewhere else — at z_k* = −W_k(−1). Infinitely many complex attractors, one per integer, all provably repelling under exp.</description>
    </item>
    <item>
      <title>Hyperbolic Functions Preserve ELC (And Why Trig Doesn&apos;t)</title>
      <link>https://monogate.org/blog/hyperbolic-preserves-elc</link>
      <guid>https://monogate.org/blog/hyperbolic-preserves-elc</guid>
      <pubDate>Wed, 22 Apr 2026 00:00:00 GMT</pubDate>
      <description>sinh, cosh, and tanh map ELC inputs to ELC outputs. sin, cos, and tan don&apos;t. Machine-verified in Lean 4. With a 3-4-5 triple bonus.</description>
    </item>
    <item>
      <title>The Exp-Log Duality at Fixed Points</title>
      <link>https://monogate.org/blog/exp-log-duality-at-fixed-points</link>
      <guid>https://monogate.org/blog/exp-log-duality-at-fixed-points</guid>
      <pubDate>Wed, 22 Apr 2026 00:00:00 GMT</pubDate>
      <description>Every repelling fixed point of exp is an attracting fixed point of log on its branch, with reciprocal multipliers. Machine-verified in Lean 4.</description>
    </item>
    <item>
      <title>Why tan(1) Controls Everything</title>
      <link>https://monogate.org/blog/tan1-obstruction</link>
      <guid>https://monogate.org/blog/tan1-obstruction</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>A single transcendence fact about tan(1) is the root cause behind three separate EML results: the multiplication lower bound, the depth-3 ceiling for standard functions, and the complex density behavior.</description>
    </item>
    <item>
      <title>The SuperBEST Table Is Complete</title>
      <link>https://monogate.org/blog/superbest-complete</link>
      <guid>https://monogate.org/blog/superbest-complete</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>Every arithmetic operation now has a proved-optimal or exhaustively-bounded node count in the exp-ln operator family. Total: 21 nodes, 71.2% savings vs naive.</description>
    </item>
    <item>
      <title>16 Operators: The Complete exp-ln Census</title>
      <link>https://monogate.org/blog/sixteen-operators</link>
      <guid>https://monogate.org/blog/sixteen-operators</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>Every binary combination of exp(±x) with ln(y) via arithmetic — completeness classification of all 16 operators.</description>
    </item>
    <item>
      <title>recip(x) Is 1 Node — ELSb Closes the Gap</title>
      <link>https://monogate.org/blog/recip-one-node</link>
      <guid>https://monogate.org/blog/recip-one-node</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>ELSb(0, x) = exp(0 − ln(x)) = 1/x. One node. SuperBEST v4: 18 nodes total, 75.3% savings. The reciprocal was never a division problem.</description>
    </item>
    <item>
      <title>The SuperBEST Cost of Quantum Mechanics</title>
      <link>https://monogate.org/blog/quantum-costs</link>
      <guid>https://monogate.org/blog/quantum-costs</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>Partition functions, time evolution, density matrices, and quantum information geometry measured in matrix EML nodes.</description>
    </item>
    <item>
      <title>The SuperBEST Cost of Geometry</title>
      <link>https://monogate.org/blog/geometry-costs</link>
      <guid>https://monogate.org/blog/geometry-costs</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>12 classical geometric primitives — hyperbolic distance, Lie group maps, curvature, conformal maps — expressed as EML operator trees. Total: 125n SuperBEST vs 345n naive, 64% savings. All exact. Updated for R16-C1 (recip = 1n).</description>
    </item>
    <item>
      <title>EML Meets Neural Networks</title>
      <link>https://monogate.org/blog/eml-neural-networks</link>
      <guid>https://monogate.org/blog/eml-neural-networks</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description> # EML Meets Neural Networks</description>
    </item>
    <item>
      <title>Negation in Two Nodes — For All Real x</title>
      <link>https://monogate.org/blog/eml-negation</link>
      <guid>https://monogate.org/blog/eml-negation</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>The neg gap is closed: exl(0, deml(x,1)) computes −x in exactly 2 nodes for all x ∈ ℝ, with no domain restriction. The SuperBEST table is complete.</description>
    </item>
    <item>
      <title>The Exact Depth Spectrum of EML</title>
      <link>https://monogate.org/blog/depth-spectrum</link>
      <guid>https://monogate.org/blog/depth-spectrum</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>Every function has a minimum node count. We now know the complete depth spectrum: 1, 2, 3, ∞ — and why depth-4 exists but contains no standard functions. Plus: multiplication drops to 2 nodes.</description>
    </item>
    <item>
      <title>The Cost Theory Is Complete</title>
      <link>https://monogate.org/blog/cost-theory-complete</link>
      <guid>https://monogate.org/blog/cost-theory-complete</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>One formula predicts the SuperBEST node cost of any scientific equation. Proved, validated on 187 equations, and open-sourced.</description>
    </item>
    <item>
      <title>Predicting SuperBEST Cost from Equation Structure</title>
      <link>https://monogate.org/blog/cost-theory</link>
      <guid>https://monogate.org/blog/cost-theory</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>Four structural classes, the cost decomposition theorem (T38), complexity classes O(1)/O(N)/O(N²), and the Linear Ceiling Conjecture (T39): a complete theory of how many EML nodes any standard scientific equation requires.</description>
    </item>
    <item>
      <title>The SuperBEST Cost of Everything</title>
      <link>https://monogate.org/blog/cost-of-everything</link>
      <guid>https://monogate.org/blog/cost-of-everything</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>From Google&apos;s PageRank to your GPS to the NFL passer rating — every equation has a node count. Here are the ones that matter.</description>
    </item>
    <item>
      <title>What If tan(1) Were Constructible?</title>
      <link>https://monogate.org/blog/conditional-tan1</link>
      <guid>https://monogate.org/blog/conditional-tan1</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>A thought experiment: if tan(1) could be built from EML trees, what would follow? The conditional chain connects to Schanuel&apos;s conjecture and would collapse the depth hierarchy.</description>
    </item>
    <item>
      <title>Why exp(+x) Means Complete: The Structural Theorem for exp-ln Operators</title>
      <link>https://monogate.org/blog/completeness-characterization</link>
      <guid>https://monogate.org/blog/completeness-characterization</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>16 operators, one structural rule: exp(+x) with no domain restriction implies exactly complete. exp(-x) implies incomplete. -exp(x) implies approximately complete. The Exponential Position Theorem explains all 16 classifications at once.</description>
    </item>
    <item>
      <title>SuperBEST Node Costs: Chemistry and Biology</title>
      <link>https://monogate.org/blog/chembio-costs</link>
      <guid>https://monogate.org/blog/chembio-costs</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>How many operator nodes does it take to compute 40 standard equations from chemistry and biology? A systematic analysis using the SuperBEST v3 routing table.</description>
    </item>
    <item>
      <title>The SuperBEST Cost of Calculus</title>
      <link>https://monogate.org/blog/calculus-costs</link>
      <guid>https://monogate.org/blog/calculus-costs</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>Taylor series, integration, ODEs, autodiff, and Fourier transforms measured in EML nodes.</description>
    </item>
    <item>
      <title>General Addition in 2 Nodes: The Last Gap Closes</title>
      <link>https://monogate.org/blog/add-gen-2n</link>
      <guid>https://monogate.org/blog/add-gen-2n</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>The only operation in SuperBEST costing more than 3 nodes was general-domain addition at 11n. It now costs 2 nodes. The table is complete.</description>
    </item>
    <item>
      <title>214 Equations: The SuperBEST Cost of Science</title>
      <link>https://monogate.org/blog/157-equations</link>
      <guid>https://monogate.org/blog/157-equations</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>A complete catalog of SuperBEST node counts for standard equations across 12+ domains — from 1-node trivialities to 2037-node error correction. Expanded from 157 (Monster Sprint) to 214 (COMP-ALL) to 295+ (domain-2 sessions: FIN, INFO, QM, THERMO, CHEM, BIO, ECON).</description>
    </item>
    <item>
      <title>The Tight Zeros Bound: How Many Zeros Can an EML Tree Have?</title>
      <link>https://monogate.org/blog/tight-zeros-bound</link>
      <guid>https://monogate.org/blog/tight-zeros-bound</guid>
      <pubDate>Sun, 19 Apr 2026 00:00:00 GMT</pubDate>
      <description>We proved that a depth-k EML tree has at most 2k+2 real zeros, and verified computationally that the true bound may be as low as 2 for all k ≥ 3. This strengthens the Infinite Zeros Barrier from qualitative to quantitative.</description>
    </item>
    <item>
      <title>The Operator Zoo: Which exp-ln Gates Are Complete?</title>
      <link>https://monogate.org/blog/operator-zoo</link>
      <guid>https://monogate.org/blog/operator-zoo</guid>
      <pubDate>Sun, 19 Apr 2026 00:00:00 GMT</pubDate>
      <description>We applied the DEML incompleteness template to seven exp-ln operators. Six are incomplete. One is open. One surprise: a gate with the identity function built in.</description>
    </item>
    <item>
      <title>We Found a Faster Multiplication: 3 Nodes</title>
      <link>https://monogate.org/blog/mul-gap-closed</link>
      <guid>https://monogate.org/blog/mul-gap-closed</guid>
      <pubDate>Sun, 19 Apr 2026 00:00:00 GMT</pubDate>
      <description>The BEST router&apos;s mul entry drops to 3 nodes via exl(ln(x), exp(y)) = x·y. The lower bound is 3n, confirmed tight by exhaustive search. Gap fully closed.</description>
    </item>
    <item>
      <title>Fourier Beats Taylor by 100x in EML Node Count</title>
      <link>https://monogate.org/blog/fourier-beats-taylor</link>
      <guid>https://monogate.org/blog/fourier-beats-taylor</guid>
      <pubDate>Sun, 19 Apr 2026 00:00:00 GMT</pubDate>
      <description>sin(x) costs 101 nodes as a Taylor series in BEST routing. The same function is 1 complex EML node using Fourier. This 100x gap validates the lab&apos;s sound design and reveals a deep structural fact about the operator.</description>
    </item>
    <item>
      <title>Timbre Is EML Node Count</title>
      <link>https://monogate.org/blog/eml-sound</link>
      <guid>https://monogate.org/blog/eml-sound</guid>
      <pubDate>Sun, 19 Apr 2026 00:00:00 GMT</pubDate>
      <description>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.</description>
    </item>
    <item>
      <title>The EML Self-Map Has No Fixed Points</title>
      <link>https://monogate.org/blog/eml-no-fixed-points</link>
      <guid>https://monogate.org/blog/eml-no-fixed-points</guid>
      <pubDate>Sun, 19 Apr 2026 00:00:00 GMT</pubDate>
      <description>f(x) = exp(x) − ln(x) satisfies f(x) &gt; x for all real x &gt; 0. The gap is minimized at x ≈ 1.31 where f(x) − x ≥ 1.648. This is a theorem about the operator&apos;s self-interaction — and it separates EML from every other operator in the family.</description>
    </item>
    <item>
      <title>EML Generates the Exponential Mandelbrot Set</title>
      <link>https://monogate.org/blog/eml-fractals</link>
      <guid>https://monogate.org/blog/eml-fractals</guid>
      <pubDate>Sun, 19 Apr 2026 00:00:00 GMT</pubDate>
      <description>Iterating exp(z)−k is Devaney&apos;s exponential family. We computed 8 operator fractal zoos, measured box-counting dimensions, and found DEML/EMN generate bounded strange attractors.</description>
    </item>
    <item>
      <title>Is the EML Closure Dense in ℂ?</title>
      <link>https://monogate.org/blog/eml-closure-density</link>
      <guid>https://monogate.org/blog/eml-closure-density</guid>
      <pubDate>Sun, 19 Apr 2026 00:00:00 GMT</pubDate>
      <description>We enumerated EML constant trees to depth 7, tested 20 random complex targets, and tracked how close EML gets to π. Strong evidence for a density conjecture — but not yet a theorem.</description>
    </item>
    <item>
      <title>The Completeness Trichotomy: EML, EMN, and Everyone Else</title>
      <link>https://monogate.org/blog/completeness-trichotomy</link>
      <guid>https://monogate.org/blog/completeness-trichotomy</guid>
      <pubDate>Sun, 19 Apr 2026 00:00:00 GMT</pubDate>
      <description>Three completeness classes for exp-ln operators: exactly complete (EML), approximately complete (EMN), and incomplete (all others). Two new theorems prove EMN&apos;s exact limits and approximate power.</description>
    </item>
  </channel>
</rss>
