{"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 contracts undecidable arbitrage halting problem","smart contracts arbitrage detection undecidable halting problem finance","formal verification DeFi arbitrage detection symbolic execution tool","universal arbitrage detection programmable contracts computability"],"source_ids":["S1","S2","S3"],"no_result_note":"No public source was found documenting a production venue that promises an exact terminating Boolean arbitrage decision for every admitted programmable instrument. The underlying computability and inconclusive-verification problem is nevertheless directly supported."},"closest_prior_art":{"queries":["Clockwork Finance automated economic security arbitrage strategies","Tradeoffs automated financial regulation mutable Turing machines","smart contract decidable logic formal requirement enforcement","SMTChecker unknown timeout formal verification"],"source_ids":["S1","S2","S3","S4"],"no_result_note":null},"historical_terminology":{"queries":["older literature algorithm decide arbitrage finite market graph negative cycle Bellman Ford no arbitrage theorem","finite state bounded model checking completeness termination","arbitrage negative cycle currency exchange algorithm"],"source_ids":["S5"],"no_result_note":null},"products_practices_standards":{"queries":["smart contract verification standards unknown timeout inconclusive result formal verification","formal verification framework smart contract DLT standard","Solidity SMTChecker unknown timeout","ESMA DLT market infrastructure operator authorisation"],"source_ids":["S3","S6","S7"],"no_result_note":null},"non_english_regional":{"queries":["site:fr \"contrats intelligents\" arbitrage indécidable vérification formelle","site:de Smart Contracts formale Verifikation unentscheidbar Arbitrage","智能合约 套利 形式化验证 不可判定 超时 未知","site:es contrato inteligente arbitraje verificación formal indecidible"],"source_ids":["S8"],"no_result_note":"The regional search found Chinese smart-contract verification material using explicit loop, timeout, call-count, and sandbox concepts, but no non-English source establishing the complete arbitrage-specific package."},"composition_subproblems":{"queries":["formal methods three valued result unknown timeout verification sound incomplete analyzer","financial contract DSL decidable formal verification bounded language smart contracts","automatic arbitrage discovery smart contracts formal model checker bounded transactions","domain specific language financial contracts formal semantics no arbitrage verification"],"source_ids":["S2","S3","S4","S5","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, Nature Portfolio","date_or_year":"2025-01-24","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["Automated financial-system compliance properties can inherit undecidability from the halting problem and Rice's theorem.","Turing-complete updates prevent reliable universal automated classification of nontrivial behavioral properties.","Restricting the permitted language or introducing permission is a proposed route to mechanically enforceable financial rules.","Finite-state trading agents can retain provable constraints that are unavailable for unrestricted programmable agents."]},{"source_id":"S2","title":"Clockwork Finance: Automated Analysis of Economic Security in Smart Contracts","url":"https://arxiv.org/abs/2109.04347","publisher":"IEEE Symposium on Security and Privacy / arXiv","date_or_year":"2023","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["Economic-security analysis of composed DeFi contracts is an active formal-methods problem.","Clockwork Finance models Turing-complete contract platforms and claims attack-exhaustive extraction within modeled contracts.","The framework explicitly supports trading-risk analysis and optimization of arbitrage opportunities.","Its evaluated scope consists of formal models of selected deployed protocols rather than a venue-wide Boolean admission certifier over arbitrary instrument and oracle semantics."]},{"source_id":"S3","title":"SMTChecker and Formal Verification — Solidity documentation","url":"https://docs.solidity.org/en/latest/smtchecker.html","publisher":"Solidity Project","date_or_year":"2026","source_type":"FIRST_PARTY_PRODUCT","language":"English","claims_supported":["A production smart-contract verification tool distinguishes proved failures from properties that might fail because the solver timed out.","The documentation explicitly labels timeout cases unknown and preserves soundness by reporting a potential failure.","Some verification properties are hard or impossible to solve automatically in the general case.","This is direct precedent for an honest non-Boolean verification status, although not for arbitrage certification or venue admission."]},{"source_id":"S4","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","date_or_year":"2018-07-01","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["Expressive formal logic can be undecidable, obstructing automatic generation and verification.","The proposed remedy separates a decidable specification layer from an implementation rule layer.","The work demonstrates an implemented restriction-to-decidable-fragment strategy on Hyperledger Fabric.","It is close causal prior art for enforced solvability scoping, but it does not decide guaranteed-profit strategies."]},{"source_id":"S5","title":"Arbitrage (Algorithms, 4th Edition)","url":"https://algs4.cs.princeton.edu/code/javadoc/edu/princeton/cs/algs4/Arbitrage.html","publisher":"Princeton University","date_or_year":"2026 access; algorithmic treatment from Algorithms, 4th ed.","source_type":"OTHER","language":"English","claims_supported":["Currency-table arbitrage is decidable in a finite graph by reduction to negative-cycle detection with Bellman-Ford.","The implementation gives a terminating yes-or-no answer under explicit arithmetic assumptions.","Floating-point rounding and overflow delimit the guarantee.","This establishes an older, narrow decidable region rather than universal programmable-instrument certification."]},{"source_id":"S6","title":"Recommendation ITU-T F.751.12 (09/2023): Formal verification framework for smart contract on distributed ledger technology","url":"https://www.itu.int/dms_pubrec/itu-t/rec/f/T-REC-F.751.12-202309-I%21%21TOC-HTM-E.htm","publisher":"International Telecommunication Union","date_or_year":"2023-09","source_type":"OFFICIAL_STANDARD","language":"English","claims_supported":["A formal-verification framework for DLT smart contracts is standardized at the international level.","The recommendation separately addresses DApp, smart-contract-mechanism, and formal-method requirements.","Formal verification architecture and an overall verification procedure are established concerns rather than speculative components."]},{"source_id":"S7","title":"DLT Pilot Regime","url":"https://www.esma.europa.eu/mt/node/207362","publisher":"European Securities and Markets Authority","date_or_year":"2026 access; regime effective from 2023","source_type":"OFFICIAL_GUIDANCE","language":"English","claims_supported":["DLT market infrastructures and their operators are identifiable regulated entities.","National competent authorities authorize and supervise DLT market infrastructures, while ESMA coordinates and publishes authorizations and exemptions.","This supplies identifiable operator and regulatory authorizer classes for a bounded certification pilot, though it does not prescribe universal arbitrage analysis."]},{"source_id":"S8","title":"CN108256337B — 智能合约漏洞检测方法、装置及电子设备","url":"https://patents.google.com/patent/CN108256337B/zh","publisher":"Google Patents record of Chinese patent CN108256337B","date_or_year":"2020-07-17","source_type":"OTHER","language":"Chinese","claims_supported":["A Chinese smart-contract verification disclosure combines DAG loop detection, explicit execution-time and call-count thresholds, and sandbox execution.","The disclosure treats exceeding the loop threshold as a vulnerability outcome rather than preserving a distinct unknown status.","It is regional prior art for bounded execution and timeout handling, but not for arbitrage, computability proofs, or tri-state admission decisions."]}],"problem_evidence":{"status":"PARTLY_SUPPORTED","finding":"The technical problem is real at the mechanism level: peer-reviewed work maps universal automated financial compliance over Turing-complete systems to computability limits; DeFi research performs formal economic-attack and arbitrage analysis; and Solidity's first-party verifier explicitly encounters unknown results and timeouts. However, the search did not identify a venue that actually exposes the proposal's exact universal Boolean arbitrage-admission promise, so that organizational scenario remains hypothetical.","source_ids":["S1","S2","S3"],"uncertainty":"A matched halting-to-arbitrage reduction is not supplied by the retained literature. Whether guaranteed profit is a nontrivial extensional program property depends on the actual VM, strategy, oracle, payoff, and self-financing semantics."},"adopter_evidence":{"status":"SUPPORTED","finding":"DLT market-infrastructure operators and national competent authorities are externally identifiable adopter and authorizer classes. ESMA documents authorization and supervision of such operators, while the ITU standard identifies DApp, mechanism, and formal-method stakeholders. No source confirms that a specifically named venue risk committee currently owns this exact arbitrage-certification decision.","source_ids":["S6","S7"],"uncertainty":"Internal ownership may sit with listing, market-risk, compliance, protocol-governance, or security functions rather than a body formally titled risk committee."},"implementation_evidence":{"status":"PARTLY_SUPPORTED","finding":"Every major implementation lever has adjacent precedent: restricted decidable specification layers, explicit unknown-on-timeout results, finite-graph arbitrage algorithms with declared assumptions, standardized smart-contract verification architectures, and bounded loop/sandbox checks. Clockwork Finance also demonstrates formal economic-attack extraction. No retained source integrates these into a reviewed halting-to-arbitrage proof plus an enforced bounded financial DSL, certificate checking, distinct unknown/timeout/out-of-scope statuses, and venue admission workflow.","source_ids":["S2","S3","S4","S5","S6","S8"],"uncertainty":"Component feasibility does not establish usefulness of the proposed subclass, correctness of certificate semantics, or safe operational handling of unknown cases."},"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":"It transfers halting-problem and Rice-theorem limits directly into automated finance and recommends permission or a less-than-Turing-complete update facility.","remaining_difference":"It analyzes regulatory compliance properties generally, not existence of an admissible self-financing guaranteed-profit strategy under a specified settlement VM and oracle model; it also does not implement the proposed tri-state venue workflow."},{"name":"Clockwork Finance economic-security analysis","source_ids":["S2"],"same_problem":true,"same_causal_lever":false,"overlap":"It formally models composed programmable financial contracts, claims exhaustive economic-attack extraction within the model, and explicitly supports arbitrage optimization.","remaining_difference":"Contract-complete modeling is not the same as a sound, complete, terminating decision procedure over every admitted program and state. The source does not present the proposal's computability-boundary proof or admission fallback."},{"name":"Solidity SMTChecker unknown-result policy","source_ids":["S3"],"same_problem":false,"same_causal_lever":true,"overlap":"It operationalizes a non-Boolean unknown result when a solver cannot decide a property within a timeout and reports conservatively for soundness.","remaining_difference":"It verifies specified Solidity properties rather than guaranteed-profit existence and does not enforce a venue-level decidable instrument subclass."},{"name":"Decidable specification layer for smart contracts","source_ids":["S4"],"same_problem":false,"same_causal_lever":true,"overlap":"It responds to undecidability by separating a decidable formal specification layer from implementation details and demonstrates the approach on a blockchain platform.","remaining_difference":"It does not formalize arbitrage, self-financing strategies, oracle semantics, one-sided arbitrage certificates, or admission decisions."},{"name":"Finite-graph arbitrage detection","source_ids":["S5"],"same_problem":true,"same_causal_lever":false,"overlap":"It supplies an exact terminating arbitrage decision for a tightly specified finite currency graph under explicit arithmetic assumptions.","remaining_difference":"It cannot represent arbitrary programmable instruments, stateful composition, external oracles, or unbounded strategy programs."}],"contrastive_claim_remaining":"For one explicitly defined settlement VM, oracle contract, payoff relation, and admissible self-financing strategy language, a property-preserving reduction can show that unrestricted exact terminating guaranteed-profit certification is impossible, while an enforced finite-state, bounded-horizon DSL plus independently checkable positive certificates and separate no-arbitrage, arbitrage, unknown, timeout, and out-of-scope outcomes terminates soundly on the declared subclass and retains useful instrument coverage.","contrastive_claim_falsifier":"The claim is falsified if the production representation and all strategy/oracle domains are already finite and effectively enumerable; if a correct total certifier exists for the actual accepted class; if the reduction fails to preserve admissibility, self-financing, payoff, oracle, or guarantee semantics; or if the bounded prototype misclassifies or fails to terminate on any proved in-scope case.","confidence":"MODERATE","search_limitations":"This was a bounded public-web search using exactly eight retained direct sources. It did not exhaust paywalled literature, patents in every jurisdiction, proprietary venue admission systems, internal risk manuals, source-code histories, or unpublished proofs. Search results cannot establish world novelty, patentability, freedom to operate, market size, or realized impact."},"researchability_gates":{"externally_supported_problem":{"status":"PASS","rationale":"Public research and first-party tool documentation independently support both the computability boundary in automated finance and the operational occurrence of inconclusive or timeout verification results. The exact venue deployment is unobserved but is not necessary to test the mechanism-level problem.","source_ids":["S1","S2","S3"]},"identifiable_adopter_or_authorizer":{"status":"PASS","rationale":"DLT market-infrastructure operators are identifiable adopters, and national competent authorities are identifiable authorizers or supervisors under the ESMA regime.","source_ids":["S6","S7"]},"distinct_testable_incremental_claim":{"status":"PASS","rationale":"Adjacent work does not eliminate the arbitrage-specific claim: the matched reduction and the sound terminating tri-state bounded-subclass implementation can be stated precisely and independently falsified.","source_ids":["S1","S2","S3","S4","S5"]},"bounded_next_evidence_step":{"status":"PASS","rationale":"One VM and oracle model, one bounded DSL, one independently reviewed reduction attempt, and a 100-instrument synthetic comparison constitute a finite reproducible next step without changing live listings.","source_ids":["S3","S4","S5","S8"]},"no_unresolved_safety_or_authority_stop":{"status":"PASS","rationale":"A sandbox-only pilot with no live approval or rejection, conservative unknown handling, independent review, and rollback to the existing process avoids an immediate authority or market-safety stop. Regulator involvement is identifiable if the pilot later affects production scope or public claims.","source_ids":["S3","S7"]},"adequate_search_evidence":{"status":"PASS","rationale":"All six required lanes were searched adversarially. The eight opened direct sources span eight records and multiple independent publishers, including three primary research sources, one official standard, one official guidance source, and one first-party product source.","source_ids":["S1","S2","S3","S4","S5","S6","S7","S8"]}},"strict_success":true,"screen_survival":true,"remaining_research_value":"MODERATE","recommended_next_step":"Run the authorized sandbox pilot: freeze a versioned VM, oracle, payoff, and strategy specification; have two independent reviewers assess a halting-to-arbitrage reduction; implement an enforced finite-state and bounded-horizon analyzer with distinct arbitrage, no-arbitrage, unknown, timeout, and out-of-scope results; then compare it with the baseline on 100 synthetic instruments, halting on any in-scope error or nontermination.","world_novelty_boundary":"The retained evidence shows close adjacent prior art for financial computability limits, decidable smart-contract fragments, bounded arbitrage algorithms, formal economic-attack analysis, and unknown-on-timeout interfaces. It does not establish that the exact arbitrage-specific reduction and integrated venue workflow are new anywhere in the world, nor does it establish patentability, freedom to operate, market size, adoption, or realized impact."}