{"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__B","search_lanes":{"direct_problem":{"queries":["smart contract verification undecidable Turing complete safety property formal verification paper","arbitrary smart contracts halting problem verification undecidable collateral solvency","Solidity SMTChecker unknown timeout official documentation","formal verification smart contracts sound complete timeout unknown static analysis"],"source_ids":["S1","S2","S3","S4","S8"],"no_result_note":"No retained source showed a real exchange demanding a universal exact solvency verdict or coercing timeout/uncertainty into approval or rejection."},"closest_prior_art":{"queries":["Marlowe financial contracts finite static analysis guaranteed no timeout official","financial contract DSL solvency collateral verification model checking bounded language","Certora Prover verification result timeout unknown official docs","smart contract verifier statuses verified violated timeout unknown sound official product"],"source_ids":["S1","S2","S3","S4","S5"],"no_result_note":null},"historical_terminology":{"queries":["Simplicity typed combinator language smart contracts bounded execution static analysis paper","Scilla smart contract language termination decidable verification official paper","soft contract verification partial correctness higher-order language","verification-led smart contracts undecidable Solidity Event-B"],"source_ids":["S3","S4","S5"],"no_result_note":null},"products_practices_standards":{"queries":["CPMI IOSCO PFMI central counterparty risk management board collateral official PDF","CFTC designated contract market listing new products risk review clearinghouse official regulation","ACTUS financial contract standard smart contract formal specification collateral official","ISDA Common Domain Model smart contract validation collateral first party"],"source_ids":["S1","S2","S6","S7"],"no_result_note":null},"non_english_regional":{"queries":["vérification formelle contrats intelligents indécidable langage Turing complet","contratos inteligentes verificación formal indecidible tiempo de espera análisis estático","智能合约 形式化验证 不可判定 超时 未知","Finanzkontrakte DSL formale Verifikation Marlowe ACTUS deutsch"],"source_ids":["S8"],"no_result_note":null},"composition_subproblems":{"queries":["\"UNKNOWN\" \"safe\" \"unsafe\" smart contract verifier result","smart contract analyzer route exact bounded sound overapproximation unknown","pre-listing programmable financial contract collateral breach verification","exchange admission policy smart contract formal verification collateral"],"source_ids":["S1","S2","S3","S4","S6","S7"],"no_result_note":"The component combination was not found as a documented end-to-end exchange workflow with a checked undecidability reduction, enforced guarantee-profile router, and admission decision record."}},"sources":[{"source_id":"S1","title":"SMTChecker and Formal Verification — Solidity documentation","url":"https://docs.soliditylang.org/en/latest/smtchecker.html","publisher":"Solidity project","date_or_year":"2026, current documentation accessed 2026-08-04","source_type":"OFFICIAL_GUIDANCE","language":"English","claims_supported":["A production smart-contract analyzer distinguishes proved and unproved targets and exposes resource limits and timeouts.","Unsupported constructs are soundly over-approximated, preserving proved-safe results while potentially producing false positives.","The analyzer combines bounded model checking and constrained-Horn-clause reasoning and includes insufficient-transfer-balance as a verification target."]},{"source_id":"S2","title":"Timeouts — Certora Prover Documentation","url":"https://docs.certora.com/en/latest/docs/user-guide/out-of-resources/timeout.html","publisher":"Certora","date_or_year":"2026, current documentation accessed 2026-08-04","source_type":"FIRST_PARTY_PRODUCT","language":"English","claims_supported":["A commercial smart-contract prover explicitly classifies hard and soft verification timeouts.","Nonlinear arithmetic, path count, and storage or memory complexity are documented causes of indeterminate runs.","Timeout reports identify solved and unsolved portions, showing that timeout can be retained as a separate operational state."]},{"source_id":"S3","title":"VerX: Safety Verification of Smart Contracts","url":"https://www.sri.inf.ethz.ch/publications/permenev20verx","publisher":"SRI Lab, ETH Zurich","date_or_year":"2020","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["Temporal safety verification is reduced to reachability for infinite-state smart contracts.","VerX combines symbolic execution and delayed predicate abstraction to obtain sound verification for a practical fragment rather than every arbitrary contract."]},{"source_id":"S4","title":"Marlowe: Implementing and Analysing Financial Contracts on Blockchain","url":"https://link.springer.com/chapter/10.1007/978-3-030-54455-3_35","publisher":"Springer Nature","date_or_year":"2020","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["A financial-contract DSL supports exhaustive pre-execution analysis of whether contracts can make required payments and returns explicit failure examples.","Termination of the symbolic translation is obtained from contract-bounded recursion plus explicit bounds on state and input structures.","Machine-checked results include money preservation, eventual timeout closure, and finite trace bounds."]},{"source_id":"S5","title":"Simplicity: A New Language for Blockchains","url":"https://arxiv.org/abs/1711.03028","publisher":"arXiv; Russell O'Connor","date_or_year":"2017","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["A loop-free, recursion-free, Turing-incomplete smart-contract language was designed to support formal semantics and static analysis.","The restricted language permits derivation of execution-resource upper bounds before execution while retaining finitary expressiveness."]},{"source_id":"S6","title":"ACTUS Technical Specification","url":"https://www.actusfrf.org/techspecs","publisher":"ACTUS Users Association","date_or_year":"2026, current specification page accessed 2026-08-04","source_type":"OFFICIAL_STANDARD","language":"English","claims_supported":["An existing financial-contract standard unambiguously maps legal contract terms to schedules of future contractual obligations.","Standardized financial-contract representations provide a plausible restricted input substrate, but the page does not claim universal solvency verification."]},{"source_id":"S7","title":"Designated Contract Markets (DCMs)","url":"https://www.cftc.gov/IndustryOversight/TradingOrganizations/DCMs/index.htm","publisher":"U.S. Commodity Futures Trading Commission","date_or_year":"2026, current guidance accessed 2026-08-04","source_type":"OFFICIAL_GUIDANCE","language":"English","claims_supported":["Designated contract markets may list new products by certifying regulatory compliance or requesting CFTC approval.","The DCM is an identifiable product-listing actor and the CFTC is an identifiable external authorizer."]},{"source_id":"S8","title":"智能合约的形式化验证","url":"https://ethereum.org/zh/developers/docs/smart-contracts/formal-verification/","publisher":"ethereum.org","date_or_year":"2026, current Chinese documentation accessed 2026-08-04","source_type":"OFFICIAL_GUIDANCE","language":"Chinese","claims_supported":["Chinese-language terminology confirms state and path explosion as verification-performance problems.","It explicitly states that a verifier cannot always decide whether a property is satisfiable because a program may fail to terminate.","It warns that some properties may remain unproved even for well-specified contracts."]}],"problem_evidence":{"status":"PARTLY_SUPPORTED","finding":"The technical core exists: general smart-contract verification can encounter undecidability, state/path explosion, unsupported constructs, and explicit timeouts, while payment sufficiency is a real analyzable financial-contract property. The operational premise is unverified: no retained source showed that exchanges admit a computationally unrestricted contract class, demand a correct terminating Boolean solvency verdict for every member, or launder UNKNOWN into approval or rejection. Existing Solidity and Certora interfaces instead preserve unproved or timeout states.","source_ids":["S1","S2","S4","S8"],"uncertainty":"A gas-bounded transaction, finite production data model, bounded horizon, or restricted admissible DSL may make the deployed class decidable; unbounded transaction sequences and external price oracles require a precise model before an undecidability reduction transfers."},"adopter_evidence":{"status":"PARTLY_SUPPORTED","finding":"A designated contract market is an identifiable product-listing actor, and the CFTC is an identifiable certification or approval authority. Financial-contract issuers and standards communities are also identifiable. The proposed internal exchange or clearinghouse risk committee and independent proof-review authority were not directly documented by the retained sources.","source_ids":["S6","S7"],"uncertainty":"The relevant authorizer may differ across DCMs, clearing organizations, decentralized protocols, and jurisdictions; authority over program semantics is not established merely by authority over product listing."},"implementation_evidence":{"status":"PARTLY_SUPPORTED","finding":"Most technical components already work separately: restricted financial DSLs permit exhaustive payment analysis; restricted smart-contract languages permit static resource bounds; practical-fragment verifiers use sound abstraction; and deployed provers distinguish proof, counterexample, unsupported input, and timeout. Evidence does not establish the proposed integrated computability audit, checked termination-to-collateral-breach reduction, guarantee-profile router, or its use in a market-listing workflow.","source_ids":["S1","S2","S3","S4","S5"],"uncertainty":"The hardest unresolved implementation obligations are faithful modeling of collateral, prices, nondeterministic counterparties and oracles; mechanical enforcement of scope promises; and independent validation of any undecidability reduction."},"prior_art":{"disposition":"ADJACENT_PRIOR_ART","closest_analogues":[{"name":"Marlowe financial-contract DSL and static analyzer","source_ids":["S4"],"same_problem":true,"same_causal_lever":true,"overlap":"Exhaustive pre-execution checking of payment failures, explicit counterexamples, bounded semantics, mechanically proved money preservation, and a deliberately restricted financial language closely match the proposed decidable-region strategy.","remaining_difference":"Marlowe starts inside a bounded DSL; it does not document an exchange-wide router spanning unrestricted, one-sided, bounded, and UNKNOWN modes or a checked impossibility certificate for rejected language classes."},{"name":"Solidity SMTChecker","source_ids":["S1"],"same_problem":true,"same_causal_lever":true,"overlap":"Checks transfer-balance failures, combines bounded and unbounded reasoning, applies sound over-approximation, and distinguishes proved, unproved, unsupported, and timeout-related outcomes.","remaining_difference":"It is a compiler verification facility rather than a pre-listing solvency policy, and it does not publish a class-level computability map or route contracts among separately governed guarantee modes."},{"name":"Certora Prover timeout handling","source_ids":["S2"],"same_problem":false,"same_causal_lever":true,"overlap":"Retains several timeout classes, diagnostic residue, and partial progress instead of treating every run as a Boolean verdict.","remaining_difference":"It addresses prover resource exhaustion and specification engineering, not market admission, collateral-breach semantics, or proof that unrestricted analysis is undecidable."},{"name":"VerX practical-fragment safety verification","source_ids":["S3"],"same_problem":false,"same_causal_lever":true,"overlap":"Uses reachability reduction, symbolic execution, and sound abstraction to verify temporal safety for a practical fragment of infinite-state contracts.","remaining_difference":"Its target is general smart-contract safety rather than financial collateral solvency, and no multi-mode admission router or computability decision record is described."},{"name":"Simplicity restricted smart-contract language","source_ids":["S5"],"same_problem":false,"same_causal_lever":true,"overlap":"Restricts expressiveness to guarantee termination-related static analysis and pre-execution resource bounds.","remaining_difference":"It supplies a decidable substrate but not collateral semantics, an unrestricted-class impossibility proof, result routing, or exchange authorization workflow."}],"contrastive_claim_remaining":"For a specifically declared production contract model, a mechanically enforced pre-listing router that first checks class eligibility and then labels each result as exact, sound one-sided, bounded, or UNKNOWN—backed by independently checked constructive or impossibility certificates—will reduce categorical admission errors versus the operator's existing workflow without exceeding predefined rejection and UNKNOWN thresholds.","contrastive_claim_falsifier":"The claim is falsified if a representation audit shows all admitted contracts already lie in one finite decidable class with a total exact analyzer; if the unrestricted reduction does not preserve collateral breach; if existing tools and policy already provide the same enforced routing and labels; or if a blinded pilot shows no reduction in categorical errors or unacceptable coverage and UNKNOWN rates.","confidence":"MODERATE","search_limitations":"The bounded search used exactly eight retained direct sources and cannot prove absence of unpublished exchange controls, proprietary verification pipelines, patents, or regional practices. Search was strongest for blockchain smart contracts and U.S. DCMs; other clearing regimes and non-blockchain programmable derivatives may use different terminology."},"researchability_gates":{"externally_supported_problem":{"status":"PASS","rationale":"Official and first-party documentation confirms undecidable or unresolved properties, timeouts, unsupported constructs, and path/state explosion; primary research confirms that payment sufficiency can be a formal contract property. The gate passes for the technical problem, while operational prevalence remains unproved.","source_ids":["S1","S2","S4","S8"]},"identifiable_adopter_or_authorizer":{"status":"PASS","rationale":"A DCM is an identifiable product-listing adopter, and the CFTC is an identifiable certification or approval authority. A pilot can be authorized within one operator even though its internal committee structure requires local confirmation.","source_ids":["S7"]},"distinct_testable_incremental_claim":{"status":"PASS","rationale":"Prior art covers the ingredients but not the documented end-to-end package. The remaining claim compares an enforced guarantee-labelled router against a legacy admission workflow using categorical-error, coverage, rejection, and UNKNOWN metrics.","source_ids":["S1","S2","S3","S4","S5"]},"bounded_next_evidence_step":{"status":"PASS","rationale":"A sandboxed corpus of 30 synthetic contracts spanning finite-state, bounded-loop, oracle-dependent, and unrestricted constructs can test scope enforcement, certificate checking, routing labels, and disagreement with baseline without affecting live listings.","source_ids":["S1","S2","S4","S5"]},"no_unresolved_safety_or_authority_stop":{"status":"PASS","rationale":"The proposed first step is non-live and reversible. Authority can remain with the DCM or operator, UNKNOWN need not authorize a listing, and concrete breach traces or out-of-scope exact labels provide explicit halt conditions.","source_ids":["S7"]},"adequate_search_evidence":{"status":"PASS","rationale":"All six required lanes were searched adversarially, including restricted-language antecedents, current analyzers and standards, Chinese/French/Spanish/German terminology, and combinations of solvency, admission, routing, bounds, soundness, and UNKNOWN. The eight retained sources include multiple independent publishers and seven primary, official, standards, or first-party sources.","source_ids":["S1","S2","S3","S4","S5","S6","S7","S8"]}},"strict_success":true,"screen_survival":true,"remaining_research_value":"MODERATE","recommended_next_step":"Before the 30-contract pilot, freeze one candidate production execution model and collateral-breach specification, including arithmetic, horizon, transaction sequencing, price-oracle behavior, and gas semantics. Have an independent reviewer either check a termination-to-breach reduction for the admitted unrestricted class or construct a total analyzer for it. Then run the blinded sandbox comparison with preregistered categorical-error, proof-check, coverage, rejection, and UNKNOWN thresholds.","world_novelty_boundary":"This bounded search supports only an adjacent-prior-art judgment and a testable integration claim. It does not establish world novelty, patentability, freedom to operate, market size, routine adoption, or realized financial impact."}