{"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 static analysis unknown timeout false negatives soundness official documentation","Ethereum smart contract verification undecidable reachability EVM formal paper","clearinghouse contract product approval risk committee collateral official rulebook"],"source_ids":["S1","S6","S7","S8"],"no_result_note":"No retained source showed a clearinghouse currently requiring an exact, always-terminating collateral-breach verdict for arbitrary program-defined contracts, or an interface coercing timeout or uncertainty into a Boolean admission decision."},"closest_prior_art":{"queries":["formal requirement enforcement smart contracts decidable logic verification","financial contract DSL decidable termination Marlowe formal semantics official","Reduced Solidity finite state model checking safety analysis","verification-led smart contracts structured families undecidable"],"source_ids":["S1","S3","S6","S7"],"no_result_note":null},"historical_terminology":{"queries":["Composing contracts financial engineering domain specific language 2000","How to write a financial contract combinator denotational semantics","algorithmic financial contract representation known unknown risk factors"],"source_ids":["S4","S5"],"no_result_note":null},"products_practices_standards":{"queries":["ACTUS standard algorithmic contract types risk collateral analysis official specification","Marlowe static analysis all execution paths contract warnings official","Solidity SMTChecker timeout unknown unsupported features official","CFTC clearing organization product collateral self-certification risk committee"],"source_ids":["S1","S5","S6","S8"],"no_result_note":null},"non_english_regional":{"queries":["智能合约 形式化验证 不可判定 超时 未知 中文","中国 智能合约 形式化验证 状态空间 标准","上海清算所 风险委员会 合格抵押品 智能合约"],"source_ids":["S2","S8"],"no_result_note":"The Chinese-language evidence addressed smart-contract verification limitations, while the regional clearing searches identified governance practices but no deployed computability-aware collateral-verdict router."},"composition_subproblems":{"queries":["smart contract collateral breach reachability model checking unknown timeout","financial contract language static analysis collateral risk known unknown","decidable contract specification unrestricted implementation smart contract","finite state bounded model checking financial smart contracts clearing admission"],"source_ids":["S1","S3","S5","S6","S7","S8"],"no_result_note":"The component mechanisms were found separately and in several close combinations, but not as a documented clearinghouse pre-listing package combining a checked collateral-breach reduction, enforced fragment routing, guarantee labels, and outcome evaluation."}},"sources":[{"source_id":"S1","title":"SMTChecker and Formal Verification — Solidity 0.8.37-develop 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-language verification interface distinguishes proved and unproved targets and reports unsupported features.","The checker permits explicit solver timeouts.","Unsupported constructs are soundly over-approximated, preserving safe conclusions while potentially creating false positives.","The documentation acknowledges that some properties are too difficult or impossible to solve automatically in the general case."]},{"source_id":"S2","title":"智能合约的形式化验证","url":"https://ethereum.org/zh/developers/docs/smart-contracts/formal-verification/","publisher":"ethereum.org","date_or_year":"2026","source_type":"OFFICIAL_GUIDANCE","language":"Chinese","claims_supported":["Formal verification can establish that smart-contract logic conforms to a specified property, subject to the model and specification.","Finite-state model checking and infinite-state theorem proving have different applicability.","Automated theorem provers may be unable to decide a logical problem, and human guidance may be required.","State explosion and computationally intensive solvers limit automated analysis."]},{"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","date_or_year":"2018","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["Expressive contract logics can be undecidable.","The authors address that boundary by separating a decidable specification layer from an implementation-rule layer.","The approach systematically checks consistency between the layers and was evaluated on Hyperledger Fabric.","Language or logic restriction is established prior art for obtaining automated smart-contract guarantees."]},{"source_id":"S4","title":"Composing contracts: an adventure in financial engineering","url":"https://www.microsoft.com/en-us/research/publication/composing-contracts-an-adventure-in-financial-engineering/","publisher":"Microsoft Research","date_or_year":"2000","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["Financial and insurance contracts have long been represented using compositional programming-language abstractions.","The work supplies a combinator library and denotational semantics for describing and valuing a large class of contracts.","Formal, executable financial-contract DSLs predate contemporary blockchain smart contracts."]},{"source_id":"S5","title":"Fundamentals","url":"https://www.actusfrf.org/methodology","publisher":"ACTUS Financial Research Foundation","date_or_year":"2019","source_type":"OFFICIAL_STANDARD","language":"English","claims_supported":["ACTUS standardizes machine-readable algorithmic financial-contract types.","Its methodology explicitly separates known contractual terms and current state from unknown future market, counterparty, and behavioral risk factors.","Contract events and state-contingent cash flows are derived relative to supplied risk scenarios rather than presented as unconditional future-solvency guarantees."]},{"source_id":"S6","title":"Marlowe's on-chain limitations","url":"https://docs.marlowe-lang.org/docs/platform-and-architecture/on-chain-limitations/","publisher":"Marlowe","date_or_year":"2026","source_type":"FIRST_PARTY_PRODUCT","language":"English","claims_supported":["A financial smart-contract product already provides simulation, static analysis, warnings, and predeployment testing guidance.","Its documentation warns that analysis does not guarantee successful execution in every operational circumstance.","Execution-cost and transaction-size limits can lock funds despite available analysis.","The documentation recommends checking execution paths in test environments before mainnet use."]},{"source_id":"S7","title":"Polynomial Timed Reductions to Solve Computer Security Problems in Access Control, Ethereum Smart Contract, Cloud VM Scheduling, and Logic Locking","url":"https://uwspace.uwaterloo.ca/items/27841dce-a7bf-4d1a-912e-ee3b6546ca05","publisher":"University of Waterloo","date_or_year":"2020","source_type":"PRIMARY_RESEARCH","language":"English","claims_supported":["A restricted subset of Solidity can be reduced to a finite-state machine and model checked for safety.","Bounded model checking, abstraction refinement, pruning, and bound estimation are established analysis techniques.","The result supplies counterevidence to treating every practically admitted smart-contract class as computationally unrestricted.","A representation and scope audit is necessary before concluding that computability, rather than complexity, is the operative barrier."]},{"source_id":"S8","title":"Industry Filings: Clearing Organization Rules","url":"https://www.cftc.gov/IndustryOversight/IndustryFilings/ClearingOrganizationRules?page=1","publisher":"U.S. Commodity Futures Trading Commission","date_or_year":"2026","source_type":"OFFICIAL_GUIDANCE","language":"English","claims_supported":["Named derivatives clearing organizations submit product, collateral, rule, and risk-parameter changes for certification or notification.","The filings identify clearing organizations and risk committees as concrete institutional actors in product and collateral governance.","The source supports an identifiable authorization setting, although it does not document the proposed automated solvency-certification requirement."]}],"problem_evidence":{"status":"PARTLY_SUPPORTED","finding":"The general problem exists: smart-contract analyzers encounter timeouts, unsupported constructs, undecidable or difficult proof obligations, state explosion, abstraction false positives, and operational cases where analysis does not guarantee successful execution. However, the specific institutional premise—financial-market operators demanding a universal exact Boolean collateral-breach verdict over an unrestricted production language—was not directly evidenced. Existing public interfaces already expose unproved, unsupported, warning, or uncertain outcomes, which weakens the claim that uncertainty is ordinarily collapsed into approval or rejection.","source_ids":["S1","S2","S3","S6","S7"],"uncertainty":"Whether a real clearinghouse admits a faithfully unrestricted contract class is unresolved. Production gas limits, finite machine representations, bounded horizons, restricted DSLs, and scenario-defined price paths may make the operative class decidable but computationally expensive. No analyzer logs or admission records from a clearinghouse were found."},"adopter_evidence":{"status":"SUPPORTED","finding":"A concrete adopter and authorizer class is identifiable: derivatives clearing organizations and designated contract markets govern product and collateral eligibility, while named risk committees participate in risk-parameter decisions and regulators receive certifications or approval requests. These institutions could authorize a synthetic pre-listing analysis pilot.","source_ids":["S8"],"uncertainty":"The evidence establishes authority and institutional locus, not willingness to adopt this proposal or current use of arbitrary programmable financial contracts."},"implementation_evidence":{"status":"PARTLY_SUPPORTED","finding":"Most technical components are independently feasible and already implemented in adjacent settings: sound over-approximation with explicit unproved or unsupported outcomes, decidable specification layers, restricted financial-contract representations, finite-state reductions, model checking, simulation, warnings, and test-environment execution. What remains unsupported is the integrated clearinghouse workflow, a checked reduction specifically preserving collateral-breach answers, enforceable routing across all proposed guarantee modes, independently checkable certificates, and measured improvement over legacy admission decisions.","source_ids":["S1","S3","S5","S6","S7"],"uncertainty":"Feasibility depends on the exact contract semantics, oracle model, arithmetic, horizon, and enforceability of fragment promises. Financial solvency also depends on stochastic or strategic external behavior that cannot be inferred solely from closed program execution."},"prior_art":{"disposition":"ADJACENT_PRIOR_ART","closest_analogues":[{"name":"Solidity SMTChecker guarantee and uncertainty handling","source_ids":["S1"],"same_problem":true,"same_causal_lever":true,"overlap":"It analyzes safety-related semantic properties, uses sound over-approximation, exposes timeouts and unsupported constructs, and separates proved from unproved results.","remaining_difference":"It is not a clearinghouse admission router, does not formalize collateral-breach reachability over market oracles, and does not publish a class-wide computability decision record."},{"name":"IBM decidable specification and implementation-layer separation","source_ids":["S3"],"same_problem":true,"same_causal_lever":true,"overlap":"It responds to undecidable expressiveness by placing requirements in a decidable logic and systematically connecting that layer to executable smart-contract rules.","remaining_difference":"It does not provide the proposed exact, one-sided, bounded, and UNKNOWN routing lattice or evaluate pre-listing collateral decisions."},{"name":"Marlowe financial-contract analysis and predeployment warnings","source_ids":["S5","S6"],"same_problem":true,"same_causal_lever":true,"overlap":"It combines a financial-contract representation with simulation, static analysis, warnings, execution-cost checks, and explicit operational limitations; ACTUS separately distinguishes contractual knowns from future-risk unknowns.","remaining_difference":"It does not claim to admit arbitrary unrestricted programs, prove an undecidability reduction for collateral breach, or implement the proposed clearinghouse governance record."},{"name":"Finite-state Reduced-Solidity safety analysis","source_ids":["S7"],"same_problem":true,"same_causal_lever":true,"overlap":"It restricts the admitted language, reduces contracts to finite-state models, applies bounded and unbounded model-checking techniques, and evaluates safety properties.","remaining_difference":"It targets a Reduced-Solidity security-analysis subset rather than a formally specified collateral-solvency property and does not study institutional handling of UNKNOWN results."}],"contrastive_claim_remaining":"For a clearinghouse that actually admits contracts outside a proven finite or otherwise decidable class, a mechanically enforced, independently reviewed router that labels each result as exact, sound one-sided, bounded, or UNKNOWN will reduce false categorical admission decisions relative to the current workflow while retaining a predefined usable coverage rate. This is an incremental deployment and governance claim, not a new computability theorem.","contrastive_claim_falsifier":"The claim is falsified if a representation audit proves all production-admissible contracts belong to one finite decidable class with a total exact analyzer; if an existing admission system already provides materially the same enforced guarantees and routing; or if a blinded synthetic pilot shows no reduction in false safe or false unsafe decisions, certificate failures, scope leakage, or an UNKNOWN rate above the predefined operational threshold.","confidence":"MODERATE","search_limitations":"The search was deliberately bounded to eight retained sources across six adversarial lanes. It found strong component-level and adjacent prior art but no direct clearinghouse analyzer records, procurement specifications, or deployed interface evidence. It did not exhaust paywalled literature, patents, proprietary exchange procedures, source-code histories, or every jurisdiction and language."},"researchability_gates":{"externally_supported_problem":{"status":"INDETERMINATE","rationale":"General verification limits and financially consequential execution failures are externally supported, but the defining operational problem—a current universal exact-verdict demand over a faithfully unrestricted clearinghouse contract class, with uncertainty coerced into a Boolean result—was not directly established.","source_ids":["S1","S2","S3","S6","S7"]},"identifiable_adopter_or_authorizer":{"status":"PASS","rationale":"CFTC filings identify derivatives clearing organizations, product and collateral certification processes, and risk committees that can own an admission-policy pilot.","source_ids":["S8"]},"distinct_testable_incremental_claim":{"status":"PASS","rationale":"Although the technical mechanisms have close prior art, the clearinghouse-specific claim that enforced guarantee routing reduces categorical admission errors at acceptable coverage remains distinct and falsifiable.","source_ids":["S1","S3","S5","S6","S7","S8"]},"bounded_next_evidence_step":{"status":"PASS","rationale":"A bounded representation audit and sandboxed comparison on 30 synthetic contracts can test class expressiveness, scope enforcement, certificate validity, error rates, and UNKNOWN coverage without touching live listings or funds.","source_ids":["S1","S3","S6","S7"]},"no_unresolved_safety_or_authority_stop":{"status":"PASS","rationale":"The proposed first step can use synthetic contracts, independent proof review, no production connectivity, and explicit halt conditions. Identified authorities can approve it; no source revealed a legal or safety prohibition on such a sandboxed evaluation.","source_ids":["S8"]},"adequate_search_evidence":{"status":"PASS","rationale":"All six required lanes were searched, including historical terminology, current products and standards, Chinese-language terminology, regional clearing practices, and combined subproblems. Exactly eight opened sources from eight publisher contexts were retained, including multiple primary, official, standards, and first-party sources.","source_ids":["S1","S2","S3","S4","S5","S6","S7","S8"]}},"strict_success":false,"screen_survival":false,"remaining_research_value":"MODERATE","recommended_next_step":"Have an independent formal-methods reviewer first formalize one clearinghouse-relevant contract representation, collateral-breach property, oracle semantics, arithmetic, and horizon, then determine whether the admitted class is finite or otherwise decidable. Only if an unrestricted or unresolved class remains should the authorizer run the 30-contract synthetic pilot, with preregistered false-safe, false-unsafe, UNKNOWN-rate, certificate-checking, and scope-enforcement thresholds.","world_novelty_boundary":"This bounded public-web review supports only a contrastive prior-art and researchability assessment. It cannot establish world novelty, patentability, freedom to operate, market size, routine adoption across all institutions, or realized operational impact."}