{"schema_version":1,"experiment_id":"eoa_inverse_innovation_exp11_mechanism_context_external20_20260804","research_id":"eoa_inverse_innovation_exp11_external_scrutiny_20260804","cell_id":"computability_boundary_mapping__economics_finance","opaque_id":"computability_boundary_mapping__economics_finance__A","search_lanes":{"direct_problem":{"queries":["programmable financial contract arbitrage undecidable halting problem","smart contract arbitrage detection undecidable verification","\"arbitrage\" \"undecidable\" smart contract","\"no-arbitrage\" computability undecidable programmable contracts"],"source_ids":["S1","S2","S4","S7"],"no_result_note":"No retained source documented a venue demanding the exact universal Boolean arbitrage certifier. Sources instead support the underlying computability risk, economically significant arbitrage, and inconclusive verifier outcomes."},"closest_prior_art":{"queries":["financial contract language decidable fragment model checking arbitrage","Turing complete smart contract verification undecidable bounded model checking unknown timeout","financial derivatives contract language total language termination formal verification","\"Tradeoffs in automated financial regulation\" authors"],"source_ids":["S1","S2","S3","S4","S5","S6"],"no_result_note":null},"historical_terminology":{"queries":["historical computational finance arbitrage decision problem algorithm decidability","\"Logic Portfolio Theory\" no-arbitrage contracts","A Formal Language for Analyzing Contracts 2002","approximation computation arbitrage frictional foreign exchange complexity"],"source_ids":["S2","S3","S6"],"no_result_note":"Older work was usually framed as formal contract languages, no-arbitrage relationships, model checking, static analysis, or computational complexity rather than universal programmable-instrument certification."},"products_practices_standards":{"queries":["site:docs.soliditylang.org SMTChecker unknown timeout unsupported formal verification","Certora prover unknown timeout result official docs","smart contract formal verification standard ISO blockchain assurance programmable instruments","EU DLT market infrastructure operator admission financial instruments smart contracts risk official"],"source_ids":["S4","S5","S8"],"no_result_note":"No standard requiring a universal exact arbitrage decision was found. Current tools and languages instead expose boundedness, unsupported features, unproved results, or restricted execution models."},"non_english_regional":{"queries":["\"Arbitragefreiheit\" Smart Contract \"unentscheidbar\"","智能合约 套利 检测 不可判定 形式化 验证","contratos inteligentes arbitraje indecidible verificación formal","site:europa.eu DLT market infrastructure admission trading risk assessment programmable financial instruments"],"source_ids":["S8"],"no_result_note":"Chinese and Spanish searches mainly returned localized Ethereum verification guidance duplicating the retained Solidity/Ethereum evidence. The retained EU source supplies distinct regional terminology and identifies DLT-market authorization roles."},"composition_subproblems":{"queries":["automated market maker arbitrage formal methods verification bounded","formalizing automated market makers Lean arbitrage","Simplicity blockchain language bounded execution formal semantics verification first party","venue listing programmable token risk committee smart contract admission regulator guidance"],"source_ids":["S1","S3","S4","S5","S6","S7","S8"],"no_result_note":null}},"sources":[{"source_id":"S1","title":"Tradeoffs in automated financial regulation of decentralized finance due to limits on mutable Turing machines","url":"https://www.nature.com/articles/s41598-024-84612-9","publisher":"Scientific Reports / Springer Nature","date_or_year":"2025","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["Permissionless Turing-complete financial systems cannot mechanically guarantee arbitrary nontrivial compliance properties.","The paper identifies restricting the update language or introducing permissioning as the feasible levers.","It explicitly places design and maintenance of validation boundaries with regulators and system operators."]},{"source_id":"S2","title":"Computer Science Abstractions To Help Reason About Decentralized Stablecoin Design","url":"https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4202600","publisher":"IEEE Access; abstract hosted by SSRN","date_or_year":"2023","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["A programmable financial system using algorithmic trading can contain financial guarantees that are not provable in the unrestricted model.","The full paper applies halting/Rice-style reasoning to smart-contract stability and arbitrage-dependent mechanisms.","This is direct financial-domain precedent for testing computability before promising a universal guarantee."]},{"source_id":"S3","title":"Formal requirement enforcement on smart contracts based on linear dynamic logic","url":"https://research.ibm.com/publications/formal-requirement-enforcement-on-smart-contracts-based-on-linear-dynamic-logic","publisher":"IBM Research / IEEE conference proceedings","date_or_year":"2018","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["Expressive contract logics may be undecidable.","The authors respond by separating a decidable specification layer from implementation rules.","A Hyperledger Fabric evaluation supplies feasibility evidence for restricted, verifiable contract specifications."]},{"source_id":"S4","title":"SMTChecker and Formal Verification","url":"https://docs.soliditylang.org/en/latest/smtchecker.html","publisher":"Solidity documentation","date_or_year":"2026","source_type":"FIRST_PARTY_PRODUCT","language":"English","claims_supported":["A production-facing verifier distinguishes proved, unproved, unsupported, and effectively unknown results.","Timeouts can prevent either outcome from being proved.","Unsupported features are over-approximated to preserve soundness, demonstrating an operational alternative to forced Boolean answers."]},{"source_id":"S5","title":"Simplicity documentation","url":"https://docs.simplicity-lang.org/","publisher":"Simplicity / Blockstream ecosystem","date_or_year":"2025–2026","source_type":"FIRST_PARTY_PRODUCT","language":"English","claims_supported":["A deployed smart-contract language can exclude loops and unbounded recursion while retaining financial-contract functionality.","Programs have statically bounded computational cost and formally defined semantics.","The language supports conditional payments, options, loans, and atomic swaps, providing evidence that a useful bounded subclass can exist."]},{"source_id":"S6","title":"Formalising and verifying smart contracts with Solidifier: a bounded model checker for Solidity","url":"https://arxiv.org/abs/2002.02710","publisher":"arXiv; Pedro Antonino and A. W. Roscoe","date_or_year":"2020","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["Bounded model checking is an implemented fallback for expressive smart contracts.","The approach deliberately abstracts and bounds Solidity/Ethereum behavior rather than claiming unrestricted completeness.","The tool searches for reachable bad states under its formalized model."]},{"source_id":"S7","title":"A Large Scale Study of the Ethereum Arbitrage Ecosystem","url":"https://www.usenix.org/conference/usenixsecurity23/presentation/mclaughlin","publisher":"USENIX Association","date_or_year":"2023","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["Arbitrage detection is operationally and economically consequential in programmable decentralized markets.","A bounded, model-specific detector found billions of opportunities rather than certifying every possible program and state.","The results show persistent opportunities and oracle-security implications, supporting the need for explicit market and oracle assumptions."]},{"source_id":"S8","title":"ESMA provides guidance to applicants under the DLT Pilot Regime","url":"https://www.esma.europa.eu/press-news/esma-news/esma-provides-guidance-applicants-under-dlt-pilot-regime","publisher":"European Securities and Markets Authority","date_or_year":"2022","source_type":"OFFICIAL_GUIDANCE","language":"English","claims_supported":["Operators of DLT multilateral trading facilities, settlement systems, and combined trading-and-settlement systems are identifiable applicants.","National competent authorities and ESMA are identifiable authorizers or supervisors.","Permission and exemption applications provide an existing governance channel for changing a DLT venue's operational scope."]}],"problem_evidence":{"status":"PARTLY_SUPPORTED","finding":"The central technical problem is supported: unrestricted automated guarantees over Turing-complete financial code encounter computability limits, while real verifiers already produce unknown, unproved, unsupported, and timeout outcomes. Arbitrage is economically material and depends on price-model and oracle assumptions. No source, however, established that a production venue currently promises an exact terminating Boolean arbitrage classification for every admitted instrument.","source_ids":["S1","S2","S4","S7"],"uncertainty":"The proposed halting-to-arbitrage reduction has not been demonstrated under a particular venue's settlement VM, oracle semantics, self-financing constraints, horizons, and definition of guaranteed profit. Gas-bounded or otherwise finite production semantics could turn the issue into tractability rather than undecidability."},"adopter_evidence":{"status":"SUPPORTED","finding":"A DLT venue operator can own the analyzer and admission boundary, while a national competent authority or other regulator can authorize material changes. ESMA's pilot-regime guidance identifies both operator applicants and supervisory authorities; the research literature also assigns validation-boundary design to regulators or permissioning operators.","source_ids":["S1","S8"],"uncertainty":"The exact committee, legal mandate, and approval path would be venue- and jurisdiction-specific."},"implementation_evidence":{"status":"PARTLY_SUPPORTED","finding":"Every major intervention component has an analogue: restricted decidable specifications, bounded model checking, statically bounded financial-contract languages, and explicit unknown/unproved/unsupported verifier results. The integrated package—matched arbitrage reduction, enforceable admission DSL, certificate checking, tri-state policy, independent review, and venue decision record—was not found as one deployed workflow.","source_ids":["S3","S4","S5","S6"],"uncertainty":"Useful instrument coverage, certificate-checking completeness, escalation capacity, and comparative operational performance remain unmeasured."},"prior_art":{"disposition":"ADJACENT_PRIOR_ART","closest_analogues":[{"name":"Computability limits for automated financial regulation","source_ids":["S1"],"same_problem":false,"same_causal_lever":true,"overlap":"Maps Turing-complete financial updates to Rice/halting limits and recommends restricted languages or permissioning.","remaining_difference":"It addresses broad regulatory compliance rather than exact guaranteed-arbitrage certification, and does not specify the proposed tri-state admission pilot."},{"name":"Undecidability reasoning for algorithmic stablecoin guarantees","source_ids":["S2"],"same_problem":false,"same_causal_lever":false,"overlap":"Applies computability reasoning to a programmable financial guarantee whose mechanism includes algorithmic trading and arbitrage.","remaining_difference":"The property is stablecoin stability, not existence of an admissible guaranteed-profit strategy; it does not supply the proposed scoped analyzer and operational fallback."},{"name":"Decidable specification layer for smart contracts","source_ids":["S3"],"same_problem":false,"same_causal_lever":true,"overlap":"Responds to undecidability by enforcing a decidable formal layer and separating implementation details.","remaining_difference":"It does not analyze arbitrage, venue admission, certificate recognition, or explicit timeout and out-of-scope outcomes."},{"name":"Solidity SMTChecker result and timeout handling","source_ids":["S4"],"same_problem":false,"same_causal_lever":true,"overlap":"Operationally preserves soundness while reporting proved, unproved, unsupported, timeout, and unknown cases instead of forcing a Boolean success.","remaining_difference":"It checks selected software-safety targets, not universal market arbitrage, and does not enforce a useful decidable instrument subclass."},{"name":"Simplicity bounded financial-contract language plus Solidifier bounded analysis","source_ids":["S5","S6"],"same_problem":false,"same_causal_lever":true,"overlap":"Demonstrates both language-level boundedness and bounded verification as practical scoping mechanisms for programmable financial contracts.","remaining_difference":"Neither source couples the mechanism to arbitrage certification, regulator-facing admission decisions, or an independently reviewed impossibility certificate."}],"contrastive_claim_remaining":"For one explicitly specified venue VM, oracle model, strategy language, payoff semantics, and horizon, a reviewed reduction can determine whether unrestricted guaranteed-arbitrage certification is noncomputable; an enforced bounded subclass with certificate checking and explicit unknown/timeout/out-of-scope results can then reduce false Boolean decisions and uncontrolled delay while retaining useful instrument coverage.","contrastive_claim_falsifier":"The claim is defeated if the actual admitted class is finite and effectively enumerable with a correct terminating exhaustive procedure; if the proposed reduction fails to preserve guaranteed profit and admissibility under the matched semantics; if substantially the same proof-scoped tri-state admission workflow is found in routine use; or if any proven in-scope pilot case is wrong or fails to terminate.","confidence":"MODERATE","search_limitations":"The bounded search used eight retained public sources and cannot establish world novelty or exhaust patents, proprietary venue controls, unpublished regulator examinations, vendor implementations, or non-indexed literature. The search found no production specification for a universal Boolean arbitrage certifier."},"researchability_gates":{"externally_supported_problem":{"status":"PASS","rationale":"Primary research supports computability limits in programmable finance, first-party verifier documentation confirms inconclusive and timeout outcomes, and empirical research establishes economically material programmable-market arbitrage. The unverified production-venue premise is a limitation but does not erase the supported technical problem.","source_ids":["S1","S2","S4","S7"]},"identifiable_adopter_or_authorizer":{"status":"PASS","rationale":"DLT market-infrastructure operators are identifiable adopters, and national competent authorities or equivalent regulators are identifiable authorizers.","source_ids":["S1","S8"]},"distinct_testable_incremental_claim":{"status":"PASS","rationale":"No retained source combines a matched halting-to-arbitrage proof with an enforced instrument subclass, certificate checking, explicit unknown states, and a regulator-facing admission workflow. Correctness, termination, coverage, decision disagreement, and review latency are measurable.","source_ids":["S1","S2","S3","S4","S5","S6"]},"bounded_next_evidence_step":{"status":"PASS","rationale":"One VM and bounded DSL can be formalized in a sandbox; two independent reviewers can attempt to reproduce the classification; and Boolean versus tri-state analyzers can be compared on 100 synthetic instruments without changing live listings.","source_ids":["S3","S4","S5","S6"]},"no_unresolved_safety_or_authority_stop":{"status":"PASS","rationale":"The proposed first step is non-live, preserves existing review authority, forbids forced Boolean answers and public impossibility claims without review, and has explicit halt and rollback conditions. Unknown cases must remain escalations rather than approvals.","source_ids":["S4","S8"]},"adequate_search_evidence":{"status":"PASS","rationale":"All six lanes were searched adversarially using direct, older, product/standard, regional/non-English, and component-combination terminology. Exactly eight retained sources were opened; they span seven publisher or institutional contexts and include primary research, official guidance, and first-party documentation.","source_ids":["S1","S2","S3","S4","S5","S6","S7","S8"]}},"strict_success":true,"screen_survival":true,"remaining_research_value":"MODERATE","recommended_next_step":"Freeze one concrete settlement VM, oracle contract, market-state representation, strategy grammar, payoff definition, and horizon. First test whether the production class is already finite. If not, have two independent formal-methods reviewers attempt the halting-to-arbitrage reduction. In parallel, implement a bounded DSL analyzer returning ARBITRAGE_CERTIFIED, NO_ARBITRAGE_PROVED, UNKNOWN, TIMEOUT, or OUT_OF_SCOPE, and compare it with the Boolean baseline on 100 synthetic cases. Stop on any in-scope error or nontermination and make no live admission decision from the pilot.","world_novelty_boundary":"This review establishes only that the proposal has adjacent public prior art and a distinct, falsifiable venue-arbitrage application remaining. It does not establish world novelty, patentability, freedom to operate, market size, usefulness across venues, or realized safety or economic impact."}