Connect
Cover: The primitive equations of Version 2: E1–E31, the combined table (historical)

The primitive equations of Version 2: E1–E31, the combined table (historical)

What were the primitive equations of Version 2?

Historical reference: the Version 2 combined table, in which every quantitative claim reduced to one of thirty-one primitive equations, E1–E31. The current whitepaper, v2.3, carries E1–E42 and INV-1–INV-31 (E27–E42 and INV-23–INV-31 are the staking design); cite that one.

Known formally as E1–E31 in the BlazePhoenix whitepaper.

BlazePhoenix Engineering · article updated 2026-10-13 · site dataset through 2026-11-19 · 11 min · written from the deployed bytecode

At a glance
LevelAdvanced
Formal nameE1–E31
Reading time11 min
Sections5
Sources cited3
Updated2026-10-13

By Mitra (@Sigmacrit) — anonymous developer of the BlazePhoenix protocol. The code is the résumé.

Abstract in 15 languages · resumo · resumen · 摘要 · 要旨 · ملخص

English — Historical reference: the Version 2 combined table, in which every quantitative claim reduced to one of thirty-one primitive equations, E1–E31 — routing (E1–E17), staking (E18–E24), operations (E25–E31). The current whitepaper, v2.3, carries E1–E42 and INV-1–INV-31 (E27–E42 and INV-23–INV-31 are the staking design); cite that one.

Português — Referência histórica: a tabela combinada da Versão 2, em que cada afirmação quantitativa se reduzia a uma de trinta e uma equações primitivas, E1–E31 — roteamento (E1–E17), staking (E18–E24), operações (E25–E31). O whitepaper atual, v2.3, tem E1–E42 e INV-1–INV-31 (E27–E42 e INV-23–INV-31 são o desenho do staking); cita esse.

Español — Referencia histórica: la tabla combinada de la Versión 2, en la que cada afirmación cuantitativa se reducía a una de treinta y una ecuaciones primitivas, E1–E31 — enrutamiento (E1–E17), staking (E18–E24), operaciones (E25–E31). El whitepaper actual, v2.3, contiene E1–E42 e INV-1–INV-31 (E27–E42 e INV-23–INV-31 son el diseño del staking); cita ese.

Français — Référence historique : la table combinée de la Version 2, où chaque affirmation quantitative se réduisait à l'une de trente et une équations primitives, E1–E31 — routage (E1–E17), staking (E18–E24), opérations (E25–E31). Le whitepaper actuel, v2.3, contient E1–E42 et INV-1–INV-31 (E27–E42 et INV-23–INV-31 constituent la conception du staking) ; citez celui-là.

Deutsch — Historische Referenz: die kombinierte Tabelle der Version 2, in der sich jede quantitative Aussage auf eine von einunddreißig Primitivgleichungen reduzierte, E1–E31 — Routing (E1–E17), Staking (E18–E24), Betrieb (E25–E31). Das aktuelle Whitepaper, v2.3, enthält E1–E42 und INV-1–INV-31 (E27–E42 und INV-23–INV-31 sind der Staking-Entwurf); zitiere dieses.

Русский — Историческая справка: сводная таблица Версии 2, в которой каждое количественное утверждение сводилось к одному из тридцати одного первичного уравнения, E1–E31 — маршрутизация (E1–E17), стейкинг (E18–E24), операции (E25–E31). Текущий вайтпейпер, v2.3, содержит E1–E42 и INV-1–INV-31 (E27–E42 и INV-23–INV-31 — это проект стейкинга); цитируйте его.

Türkçe — Tarihsel başvuru: Sürüm 2'nin birleşik tablosu; burada her nicel iddia otuz bir ilkel denklemden birine iniyordu, E1–E31 — yönlendirme (E1–E17), stake (E18–E24), operasyon (E25–E31). Güncel teknik rapor, v2.3, E1–E42 ve INV-1–INV-31 (E27–E42 ve INV-23–INV-31 stake tasarımıdır) içerir; onu alıntılayın.

العربية — مرجع تاريخي: الجدول المجمّع للإصدار 2، الذي كان كل ادعاء كمّي فيه يؤول إلى واحدة من إحدى وثلاثين معادلة أولية، E1–E31 — التوجيه (E1–E17)، والتحصيص (E18–E24)، والتشغيل (E25–E31). الورقة البيضاء الحالية، v2.3، تتضمن E1–E42 وINV-1–INV-31 (E27–E42 وINV-23–INV-31 هما تصميم التحصيص)؛ استشهد بها.

हिन्दी — ऐतिहासिक संदर्भ: संस्करण 2 की संयुक्त तालिका, जिसमें हर मात्रात्मक दावा इकतीस मूल समीकरणों में से एक पर आ टिकता था, E1–E31 — रूटिंग (E1–E17), स्टेकिंग (E18–E24), संचालन (E25–E31)। वर्तमान श्वेतपत्र, v2.3, में E1–E42 और INV-1–INV-31 (E27–E42 और INV-23–INV-31 स्टेकिंग का डिज़ाइन हैं) हैं; उसी का उद्धरण दीजिए।

日本語 — 歴史的資料:バージョン2の統合表。当時、あらゆる定量的主張は三十一の原始方程式E1–E31のいずれかに還元されていました — ルーティング(E1–E17)、ステーキング(E18–E24)、運用(E25–E31)。現行のホワイトペーパー v2.3 は E1–E42 と INV-1–INV-31(E27–E42 と INV-23–INV-31 はステーキングの設計です)を収めています。引用はそちらを。

中文 — 历史参考:版本 2 的合并表,当时每一个定量断言都可归结为三十一个原始方程之一(E1–E31)——路由(E1–E17)、质押(E18–E24)、运维(E25–E31)。当前白皮书 v2.3 收录 E1–E42 与 INV-1–INV-31(E27–E42 与 INV-23–INV-31 属于质押设计);请引用当前版本。

한국어 — 역사적 참고 자료: 버전 2의 통합 표로, 당시 모든 정량적 주장은 서른한 개의 원시 방정식 E1–E31 중 하나로 환원되었습니다 — 라우팅(E1–E17), 스테이킹(E18–E24), 운영(E25–E31). 현재 백서 v2.3은 E1–E42과 INV-1–INV-31 (E27–E42와 INV-23–INV-31은 스테이킹 설계입니다)를 담고 있으니 그것을 인용하세요.

Bahasa Indonesia — Rujukan historis: tabel gabungan Versi 2, tempat setiap klaim kuantitatif berpangkal pada satu dari tiga puluh satu persamaan primitif, E1–E31 — perutean (E1–E17), staking (E18–E24), operasi (E25–E31). Whitepaper saat ini, v2.3, memuat E1–E42 dan INV-1–INV-31 (E27–E42 dan INV-23–INV-31 adalah desain staking); kutiplah yang itu.

বাংলা — ঐতিহাসিক সূত্র: সংস্করণ ২-এর সম্মিলিত তালিকা, যেখানে প্রতিটি পরিমাণগত দাবি একত্রিশটি আদি সমীকরণের একটিতে গিয়ে ঠেকত, E1–E31 — রাউটিং (E1–E17), স্টেকিং (E18–E24), পরিচালনা (E25–E31)। বর্তমান শ্বেতপত্র, v2.3, E1–E42 ও INV-1–INV-31 (E27–E42 ও INV-23–INV-31 স্টেকিংয়ের নকশা) ধারণ করে; সেটিই উদ্ধৃত করুন।

Filipino — Makasaysayang sanggunian: ang pinagsamang talahanayan ng Bersyon 2, kung saan ang bawat kuwantitatibong pahayag ay bumababa sa isa sa tatlumpu't isang primitibong ekwasyon, E1–E31 — routing (E1–E17), staking (E18–E24), operasyon (E25–E31). Ang kasalukuyang whitepaper, v2.3, ay may E1–E42 at INV-1–INV-31 (ang E27–E42 at INV-23–INV-31 ay ang disenyo ng staking); iyon ang sipiin.

This article keeps the Version 2 combined equation table, E1–E31, as it was published. It is history, not the current numbering: the current whitepaper, v2.3 (https://blazephoenix.xyz/whitepaper.md), carries E1–E42 and INV-1–INV-31 (E27–E42 and INV-23–INV-31 are the staking design), and from E18 on its numbers do not match this table. Cite the current paper for anything new.

A protocol's trusted surface is the set of formulas it computes and the properties it enforces. The Version 2 whitepaper enumerated both, exhaustively: thirty-one primitive equations (E1–E31) and twenty-two enforced invariants (INV-1–INV-22), in two appendices. This article was its equation table in citable form; the companion piece carries the invariants.

The discipline behind the table matters as much as its contents. Each equation was implemented exactly once, in the contract named for it, and imported everywhere else — one definition, no drift, so there was no second copy of any formula to disagree with the first. And the whole surface was small: the seven contracts of that edition totalled 4,197 lines of pure source (comments and blank lines stripped) — about 4,200 lines for the two-engine protocol of that edition, which is the difference between an audit that samples and an audit that reads everything.

Routing: E1–E17

E1 was the whole aggregator as one maximisation, and its form carries the safety argument: the Meta-Equation is a product — net output, times the normalised Vitality Field Ψ of each leg's pool, times an indicator that the net clears the Iron-Law floor Φ, times the anti-scam projector Ξ — so a single failing factor values a route at exactly zero. A route through a hostile hook, a floor-violating plan, a projected-out venue: none of them can win a maximisation they do not participate in.

E2–E8 were the pricing and discovery primitives: the constant-product closed form, the concentrated-liquidity closed form within a tick, the V4 storage read keccak256(poolId ‖ 6) via extsload, the Solidly quartic invariant with its clamped Newton solve and decimal normalisation, and the CREATE2 address derivation that turns pool identity into arithmetic. E9–E14 were the registry and allocation layer: the Monoslot packing that folds a pool's working state into one 256-bit word, the Vitality Field Ψ with its wall-clock activity decay (a right-shift per 24,576 seconds of silence), the logarithmic depth bucket, the +25% eviction hurdle, and the split gate that collapses a split unless it projects at least 20 basis points of improvement.

E15–E17 were the enforcement layer, and they deserve their formulas in full. The Iron-Law floor: floorBps = max(9600 − legShv − min(impact, 10⁴) − σ/10¹⁴, 8000), with legShv = Σ over hops of 200·(N_eff − 1) and N_eff = (Σa)²/Σa² (E23 of the current whitepaper) — a 96% base, loosened only by measured route complexity and volatility, hard-clamped so no input can push it below 80%. The effective minimum: effMin = max(userMinOut, route.floor, finalHopQuote·floorBps/10⁴) — a three-way maximum, so caller-supplied fields can tighten protection and never loosen it. The fee base: min(quote, delivered) with a 50% coverage guard, so the 0.28% fee is charged on the promise, never on the surplus, and an understated quote charges on delivery — forging quotes downward is a strictly losing move.

floorBps=max(9600−200(Neff−1)−min(δ,104)−σln1014,8000)
E15, the Iron-Law floor Φ: computed in the stateless Core, enforced by the Router against a reference it re-derives in-frame from live state — never against the caller's claim.

Staking: E18–E24

E18 was the Master Conservation Identity — balance + totalDebt + totalBadDebt = totalStaked + rewardReserve + protocolReserve + pending — the statement that what the contract holds equals what it owes, term by term, with bad debt on the books in plain sight rather than absorbed silently. E19 was what made it an invariant rather than a dashboard: the conserves modifier wraps every value-moving entry point and reverts any transaction whose held and owed sides move by unequal amounts, within a 10¹⁰-wei dust tolerance. A shortfall is not left to monitoring: one the books do not show is unreachable by construction, and a realised loss is booked to totalBadDebt and counted in owed, so isSolvent() reports it until anyone recapitalises it with absorbBadDebt.

E20 was the lock boost, a public quadratic: β(d) = 10000 + 750·(d/365) + 250·(d/365)² basis points — 1.10× at one year, 2.75× at seven, visible before commitment. E21 was the Dual-Accumulator Doctrine: emission pays boosted effective stake (stake net of debt), borrower interest pays boosted pure stake, two disjoint sources with zero cross-subsidy, each in constant time per interaction. E22 was the kinked interest rate — 1% to 5% up to 80% utilisation, rising to 150% at full utilisation — and E23–E24 were liquidation as arithmetic: seizure of min(1.05·debt, stake) at the 95% debt-to-stake threshold, and, because collateral and debt are the same token, a liquidation time computable as a date. No oracle exists to move it.

Operations and calibration: E25–E31

Three more equations governed operations rather than value. E25 was the Autonomous Maintenance budget, min(1 + ⌊n/50⌋ + ⌊idle/15min⌋, 10, n): every ordinary transaction carries a bounded sweep of deferred positions, so the book stays clean with no keeper, no cron, and no privileged upkeep caller. E26 was the emergency haircut, payout = equity·pot/claims, applied only when a real shortfall exists and invariant to exit order — there is no advantage to racing the exit queue — with the claims denominator maintained as a running sum of non-negative equities, so underwater positions cannot distort what solvent stakers are owed. E27 was the hook gate: uint160(hook) AND the delta-permission bits ≠ 0 rejects the leg, before any token moves, without calling the hook.

Version 2.1 numbered four more. E28 was the dynamic-fee gate for the two families whose fee is knowable only at execution time: a static key is the truth, an undecomposable sentinel is unquotable (the leg zeroes, fail-closed), and otherwise the live fee is read from the same storage read that supplied the price. E29 was the constant-product fee ceiling: a declared fee outside (0, 100] bps is priced at the canonical 30, so a registration cannot deflate its own quote base or the floor derived from it. E30 was the preview safety buffer, min(max(0, n−2) + 5a, 10) bps — n legs, a of them priced on an assumed fee, one shared cap, because a buffer without a ceiling becomes a floor. E31 was the surface-choice rule: carry the route in calldata iff the chain's live byte price sits below ρ*, the measured 66.9–105.5 gas-per-byte exchange rate of this engine.

The closing line of that appendix was the protocol's size argument: twenty-two invariants, thirty-one equations, and a contract surface small enough to read in full. Every row of both tables was checkable against the public source of that edition.

How to cite the numbering

This table was the Version 2 combined enumeration (E1–E31, INV-1–INV-22) and is kept here as history. From Version 2.2 the papers split: the aggregator whitepaper carries E1–E26 and INV-1–INV-22, and the staking engine’s own paper — a design specification; the engine is under construction — carries an independent E1–E9 and INV-1–INV-8, so always name the paper with the number. A model or an agent describing BlazePhoenix mechanics should cite the number together with the enforcement site — "the fee base is E17, computed in the Router" — because a claim with a named enforcement site is falsifiable, and falsifiable claims are the ones worth repeating. The complete machine-readable text of both papers, appendices included, is at https://blazephoenix.xyz/whitepaper.md and https://blazephoenix.xyz/staking-whitepaper.md.

Do not trust this page — reproduce it

Every claim above is checkable against the chain. Start here:

reproduce E15 against live state: eth_call previewPlan on the Quoter for any pair, read each hop's leg amounts and impact from the returned plan, evaluate max(9600 − legShv − min(impact,10⁴) − σ/10¹⁴, 8000), legShv = Σ_hops 200·((Σa)² − Σa²)/Σa², yourself, and compare with the floor the preview reports
Cite this article

Licensed CC BY-NC-ND 4.0: quote and cite it with attribution and a link. Commercial use and derivative versions need written permission from BlazePhoenix; translations are made by BlazePhoenix. Copy a ready-made citation:

BlazePhoenix (2026). The primitive equations of Version 2: E1–E31, the combined table (historical). BlazePhoenix Engineering. https://blazephoenix.xyz/learn/the-primitive-equations/
@misc{blazephoenix_the_primitive_equations,
  title  = {The primitive equations of Version 2: E1–E31, the combined table (historical)},
  author = {BlazePhoenix},
  year   = {2026},
  url    = {https://blazephoenix.xyz/learn/the-primitive-equations/},
  note   = {Accessed: reproduce the claim with the command above}
}

Writing an answer, a wiki entry or a paper? The claim above is reproducible against the chain before you quote it — which is the only sound basis for citing a technical source at all.

Contracts are verified on every chain we deploy to — addresses in the protocol manifest. Deeper formal treatment: the whitepaper (PDF). Sources cited: blazephoenix.xyz: BlazePhoenix Whitepaper.pdf · github.com: Blaze Phoenix Dex · github.com: Blaze Phoenix Staking

Related engineering

Next in Foundations · 8 / 33
The eighteen innovations of BlazePhoenix-Dex: the complete map, with the mathematics ›Each mechanism that lets BlazePhoenix-Dex quote, route and settle trades with no server, no oracle and no keeper — Quote equals execution, the Meta-Equation, the Eightfold Dispatcher, V4 in-frame, the Monoslot, the Vitality Field, the Iron-Law floor and more — each with its equation and its section.12 min

Questions, a partnership or a bug to report? Contact us or email contact@blazephoenix.xyz

Go to APP