The design goal is trust less, not more: not to grow the list of things the system relies on, but to need fewer of them. In the contracts of the 2.0.0 generation (launch scheduled for 15 December 2026, not deployed yet) that goal takes four forms: discovery by derivation, a Solver that runs on-chain, execution that re-imposes its own conditions on the realised result, and an explicit, time-delayed policy where trust remains.

Trust-minimised routing: discovery, on-chain solving and re-checked execution
What does BlazePhoenix routing trust, and what does it derive or measure instead?
How the BlazePhoenix 2.0.0 contracts reduce what routing trusts: CREATE2 discovery with the registry as a freshness-gated shortcut, an on-chain Solver, execution re-checked on measured deltas, and gates as explicit policy.
BlazePhoenix Engineering · article updated 2026-10-22 · site dataset through 2026-11-19 · 8 min · written from the deployed bytecode
By Mitra (@Sigmacrit) — anonymous developer of the BlazePhoenix protocol. The code is the résumé.
Abstract in 15 languages · resumo · resumen · 摘要 · 要旨 · ملخص
English — The trust model of BlazePhoenix 2.0.0 routing: CREATE2 discovery with the registry as a freshness-gated shortcut (_registryFresh, MIN_FRESH_VENUES, tier 0), an on-chain Solver read by eth_call, execution re-checked on measured deltas against userMinOut and protocolFloorOut, and gates as an explicit policy. What is derived, measured or policy, in one table.
Português — O modelo de confiança do encaminhamento da BlazePhoenix 2.0.0: descoberta por CREATE2 com o registo como atalho sujeito a frescura (_registryFresh, MIN_FRESH_VENUES, tier 0), um Solver on-chain lido por eth_call, execução reconferida sobre deltas medidos contra userMinOut e protocolFloorOut, e gates como política explícita. O que é derivado, medido ou política, numa tabela.
Español — El modelo de confianza del enrutamiento de BlazePhoenix 2.0.0: descubrimiento por CREATE2 con el registro como atajo sujeto a frescura (_registryFresh, MIN_FRESH_VENUES, tier 0), un Solver on-chain leído por eth_call, ejecución recomprobada sobre deltas medidos frente a userMinOut y protocolFloorOut, y gates como política explícita. Lo derivado, lo medido y lo que es política, en una tabla.
Français — Le modèle de confiance du routage de BlazePhoenix 2.0.0 : découverte par CREATE2 avec le registre comme raccourci soumis à fraîcheur (_registryFresh, MIN_FRESH_VENUES, tier 0), un Solver on-chain lu par eth_call, une exécution revérifiée sur des deltas mesurés face à userMinOut et protocolFloorOut, et des gates comme politique explicite. Ce qui est dérivé, mesuré ou politique, dans un tableau.
Deutsch — Das Vertrauensmodell des Routings von BlazePhoenix 2.0.0: Entdeckung per CREATE2 mit dem Register als frischegebundener Abkürzung (_registryFresh, MIN_FRESH_VENUES, Tier 0), ein On-Chain-Solver, gelesen per eth_call, Ausführung, die auf gemessenen Deltas gegen userMinOut und protocolFloorOut nachgeprüft wird, und Gates als explizite Regel. Was abgeleitet, gemessen oder Regel ist, in einer Tabelle.
Русский — Модель доверия маршрутизации BlazePhoenix 2.0.0: обнаружение через CREATE2, где реестр служит сокращением с условием свежести (_registryFresh, MIN_FRESH_VENUES, tier 0), ончейн-Solver, читаемый через eth_call, исполнение, перепроверяемое по измеренным дельтам против userMinOut и protocolFloorOut, и гейты как явная политика. Что выводится, что измеряется и что является политикой, в одной таблице.
Türkçe — BlazePhoenix 2.0.0 yönlendirmesinin güven modeli: kaydın tazelik koşullu bir kısayol olduğu CREATE2 keşfi (_registryFresh, MIN_FRESH_VENUES, tier 0), eth_call ile okunan zincir üstü bir Solver, userMinOut ve protocolFloorOut karşısında ölçülen deltalarla yeniden denetlenen yürütme ve açık bir politika olarak gate'ler. Neyin türetildiği, ölçüldüğü ya da politika olduğu tek bir tabloda.
العربية — نموذج الثقة في توجيه BlazePhoenix 2.0.0: اكتشاف عبر CREATE2 مع السجل كاختصار مشروط بالحداثة (_registryFresh وMIN_FRESH_VENUES والمستوى 0)، وSolver على السلسلة يُقرأ عبر eth_call، وتنفيذ يُعاد فحصه على الفروق المقاسة مقابل userMinOut وprotocolFloorOut، والبوابات كسياسة صريحة. ما هو مشتق وما هو مقاس وما هو سياسة، في جدول واحد.
हिन्दी — BlazePhoenix 2.0.0 routing का भरोसा मॉडल: CREATE2 से खोज, जिसमें registry ताज़गी की शर्त वाला shortcut है (_registryFresh, MIN_FRESH_VENUES, tier 0), eth_call से पढ़ा जाने वाला on-chain Solver, userMinOut और protocolFloorOut के मुक़ाबले मापे गए deltas पर दोबारा जाँचा गया execution, और स्पष्ट नीति के रूप में gates। क्या निकाला गया, क्या मापा गया और क्या नीति है, एक तालिका में।
日本語 — BlazePhoenix 2.0.0 のルーティングの信頼モデル:レジストリを鮮度条件つきの近道とする CREATE2 による発見 (_registryFresh、MIN_FRESH_VENUES、tier 0)、eth_call で読むオンチェーンの Solver、userMinOut と protocolFloorOut に対して測定差分で再確認される実行、明示的な方針としてのゲート。導出・測定・方針の区別を一つの表で。
中文 — BlazePhoenix 2.0.0 路由的信任模型:以 CREATE2 发现,登记表只是附带新鲜度条件的捷径 (_registryFresh、MIN_FRESH_VENUES、tier 0);链上 Solver 通过 eth_call 读取;执行按实测差额对照 userMinOut 与 protocolFloorOut 重新核验;网关作为明确的政策。哪些是推导、哪些是实测、哪些是政策,汇于一张表。
한국어 — BlazePhoenix 2.0.0 라우팅의 신뢰 모델: 레지스트리를 신선도 조건이 붙은 지름길로 쓰는 CREATE2 발견 (_registryFresh, MIN_FRESH_VENUES, tier 0), eth_call로 읽는 온체인 Solver, userMinOut과 protocolFloorOut에 대해 측정된 차이로 다시 확인되는 실행, 그리고 명시적 정책으로서의 게이트. 무엇이 도출되고, 측정되고, 정책인지 한 표로 정리합니다.
Bahasa Indonesia — Model kepercayaan perutean BlazePhoenix 2.0.0: penemuan lewat CREATE2 dengan registri sebagai jalan pintas bersyarat kesegaran (_registryFresh, MIN_FRESH_VENUES, tier 0), Solver on-chain yang dibaca lewat eth_call, eksekusi yang diperiksa ulang pada delta terukur terhadap userMinOut dan protocolFloorOut, dan gate sebagai kebijakan eksplisit. Apa yang diturunkan, diukur, atau kebijakan, dalam satu tabel.
বাংলা — BlazePhoenix 2.0.0 routing-এর বিশ্বাস মডেল: CREATE2 দিয়ে আবিষ্কার, যেখানে registry সতেজতার শর্তযুক্ত shortcut (_registryFresh, MIN_FRESH_VENUES, tier 0), eth_call দিয়ে পড়া on-chain Solver, userMinOut ও protocolFloorOut-এর বিপরীতে মাপা delta দিয়ে পুনরায় যাচাই করা execution, আর স্পষ্ট নীতি হিসেবে gates। কী নির্ণীত, কী মাপা আর কী নীতি, এক টেবিলে।
Filipino — Ang modelo ng tiwala ng routing ng BlazePhoenix 2.0.0: pagtuklas sa CREATE2 na ang registry ay shortcut na may kondisyon ng pagkasariwa (_registryFresh, MIN_FRESH_VENUES, tier 0), isang on-chain Solver na binabasa sa eth_call, pagpapatupad na muling sinusuri sa sinukat na delta laban sa userMinOut at protocolFloorOut, at mga gate bilang hayag na patakaran. Ang hinango, sinukat o patakaran, sa iisang talahanayan.
Discovery: derived, with the registry as a shortcut
Hub.discoverFor walks the admitted factory rows and derives candidate addresses for a pair. Rows in the CREATE2 modes (4 to 7) compute the address with Core.create2Address from the factory, the salt of the pair and the factory's init-code hash; a derivation is something the factory cannot influence after admission. Rows in the lookup modes (0 to 3) ask the factory, and such a row stops producing candidates if the factory's code hash moves from the one pinned at admission. For Algebra, the CREATE2 origin is the one attested at admission, not a live answer.
The registry is a gas shortcut, not the source of truth. Solver._topKPools merges registered and discovered candidates, and skips the discovery sweep when _registryFresh holds: at least MIN_FRESH_VENUES (3) registered rows saw activity within DISCOVERY_TTL_SECONDS (3,600 seconds). Rows of tier 0, seeded by an operator, are counted; permissionless rows (tier 2) stay candidates but cannot switch discovery off.
Solving: a quote is an eth_call
Solver.findBestRoutePlan is an external view function, and Quoter.previewPlan calls it, so a quote is an eth_call you can run on your own node. There is no off-chain solver to trust for the number. The best-route door, Router.swapBestExactIn, calls the same immutable Solver inside the transaction, with a gas budget of SOLVE_GAS (12,000,000).
Execution: re-checked on the realised result
The Router does not take the route's figures as settled. The input is measured as a balance change, not read from an argument. For each leg it measures the output as a balance change, and requires at least LEG_FLOOR_BPS (80 percent) of a bound: the caller's attested figure pro-rata, raised to MIN_QUOTE_COVERAGE_BPS (50 percent) of the leg quote measured in the transaction when the attestation falls below it. The caller can push that bound up, never down.
At the end, amountOut is the balance change against the entry baseline. It must reach the strictest of the caller's userMinOut, the route's singleOutFloor and protocolFloorOut, which is derived from the in-transaction quote of the final hop. After the fee, the amount delivered is measured again at the recipient and compared with userMinOut. A userMinOut of zero is refused, and V4 legs whose hook can alter deltas are refused at execution.
Gates: an explicit policy, not an absence of trust
Some trust remains, and the contracts state it. On the automatic route, the registry's reads filter Uniswap V4 rows by Hub.isHookLive: a hook must be on the curator's list and its code must still match the hash pinned when it was listed. A hook nobody listed is the caller's own signed choice on an explicit route, bounded by the same floors; a revoked hook is refused on every door.
Venues behind the BlazePhoenixGate are admitted through adapters: proposeAdapter, a 48-hour ADAPTER_DELAY, then acceptAdapter, with the code hash pinned and re-checked on each swap; clearAdapter revokes a family at once. Discovery removes hand-kept address lists, but the admission of these venues keeps a declared policy with a waiting period that anyone can watch on-chain.
The trust model in one table
Each element of routing falls in one of three classes: derived (computed from public inputs), measured (read from balances in the transaction), or policy (a stated decision, with its delay where it has one).
| Element | Class | Where |
|---|---|---|
| Pair address in CREATE2 modes | Derived | Hub.discoverFor, Core.create2Address |
| Gate wrapper identity | Derived | BPC.gateWrapperLive, Core.v3Salt |
| Registry shortcut | Policy, freshness-gated | Solver._registryFresh, tier 0 |
| Route plan | Derived on-chain | Solver.findBestRoutePlan |
| Input, leg output, final output | Measured | Router balance deltas |
| Floors | Measured, caller can tighten | LEG_FLOOR_BPS, protocolFloorOut, userMinOut |
| V4 hooks on the automatic route | Policy | Hub.allowHook, Hub.isHookLive |
| Gate adapters | Policy, 48 h delay | proposeAdapter, acceptAdapter, clearAdapter |
| Factories and venue kinds | Policy | Hub.addFactory |
What discovery does not do
Derivation is a way to find pairs on venues the Hub already knows how to read. A new AMM family still needs an adapter and configuration: a factory row admitted with Hub.addFactory, with its kind, its discovery mode and its init-code hash, and, for a venue shape the Core cannot read, a Gate adapter admitted through the timelock. Discovery does not make an arbitrary exchange compatible.
Do not trust this page — reproduce it
Every claim above is checkable against the chain. Start here:
git clone https://github.com/blazephoenixxyz-crypto/Blaze-Phoenix-Dex && cd Blaze-Phoenix-Dex && grep -n 'function _registryFresh\|MIN_FRESH_VENUES *=' src/BlazePhoenixSolver.sol && grep -n 'MIN_QUOTE_COVERAGE_BPS *=\|uint256 delivered' src/BlazePhoenixRouter.sol && grep -n 'function isHookLive\|function discoverFor' src/BlazePhoenixHub.solCite 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). Trust-minimised routing: discovery, on-chain solving and re-checked execution. BlazePhoenix Engineering. https://blazephoenix.xyz/learn/trust-minimised-routing/@misc{blazephoenix_trust_minimised_routing,
title = {Trust-minimised routing: discovery, on-chain solving and re-checked execution},
author = {BlazePhoenix},
year = {2026},
url = {https://blazephoenix.xyz/learn/trust-minimised-routing/},
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: EIP-1014
Related engineering
- Why BlazePhoenix needs to trust less ›
- Gated pools: how BlazePhoenix routes through permissioned venues ›
- Gate vitality and adapter depth: asking the venue ›
- CREATE2 discovery: verifying a pool is who it claims to be ›
- On-chain quoting: why the price you see is the price the contract computed ›
- The iron floor: a minimum output the contract re-derives for itself ›
- Screening Uniswap V4 hooks by arithmetic: why BlazePhoenix never asks a hook anything ›
Questions, a partnership or a bug to report? Contact us or email contact@blazephoenix.xyz