Skip to content

v2.3.0

Choose a tag to compare

@github-actions github-actions released this 11 Oct 09:53
· 915 commits to main since this release
61c2ab9

Antecedent 2.3.0

Changes since Antecedent 2.2.0. The release adds reusable causal results, checked decision and study-planning handoffs, selective recalculation, and measured uncertainty for five additional method families.

Consumer workflows

If you need to… Start here What 2.3 adds
Carry a result into a decision, inverse query or reusable artifact Result lifecycle and decisions Named quantities, units, support and source provenance survive supported handoffs; aligned laws enable probability, quantile and nonlinear utility
Rank the next study using current evidence Study ranking Typed structural and numerical objectives, checked prior-to-signal inputs, explicit costs and independently consumed rankings
Update part of an analysis when inputs change Selective recalculation Retained adjusted, doubly robust, finite response/transport, Bayesian, temporal and design state; receipts identify executed work and compatible reuse
Use uncertainty in Bayesian transport, nested-Markov effects, repeated histories or recovered observations Population, time and uncertainty Method-specific measured scalar intervals with original-source replay and refusals outside the validated protocol
Combine external results with native analysis External evidence and composition Checked finite responses, aligned laws and bounded mean callbacks retain provider identities and their declared trust
Compare structural or sensitivity scenarios Sensitivity and robustness Per-scenario evidence, decision ranges, covariance-aware comparisons and preserved assumption boundaries

The five new measured families are joint Bayesian transport, learned joint transport, nested-Markov Bayesian and Fisher inference, dependent temporal intervals, and sampled observation recovery. Their public adapters return inference.MeasuredInference only for the named scalars and validated graph, data, prior and numerical protocol. Loading an exported result independently replays its original source and verifies the applicable evidence. These method-specific licenses do not extend to arbitrary models, parameter-wide intervals or simultaneous coverage.

The original source artifacts and diagnostic summaries retain their declared statistical meaning. A mean supplies no joint law; structural ranges and sensitivity ranges supply no sampling confidence. Decisions from fitted effect models, general transported path-specific counterfactuals, discovery recalculation, adaptive policies and arbitrary callback/cross-world execution remain outside 2.3's supported workflows. See the linked guides for their exact boundaries.

Python API changes

The new decision.Contract.evaluate supports checked decision inputs; design.rank_designs adds typed objectives including declared structural sufficiency and cost; design.rank_structural remains a convenience view. The naming dictionary lists the current stage modules and supported Rust/Python entry points. Examples use the 2.3 API.

How to read the claims

Term Meaning
point_only An exact or plug-in point estimate. No interval of any kind is claimed.
nominal An interval whose coverage was never measured at its own coordinate (estimator_grid_not_measured). Unmeasured diagnostics grant no coverage license.
calibrated An interval with a coverage record measured at its own coordinate; shown to readers as a statistical interval. A cell is described this way only once its records exist.
structural_envelope The range of an answer over explicitly supplied structural scenarios. Not a confidence interval.
assumption_range The range of an answer over a declared sensitivity set. Not a confidence interval.
none No numerical claim: identification or inspection only.
statistical interval The reader-facing name of a calibrated interval; it appears only beside a measured coverage record.

2.3A cells

F15: joint distribution semantics

Claim: point_only

  • Question: Can a consumer tell whether supplied draws represent one aligned joint realization, and which causal quantity each axis means?
  • Scope: A previously identified, finite coordinate causal claim; graph identification belongs to its prerequisite record.
  • Guarantee: checked_joint_alignment_and_axis_identity_semantics_only_no_identification_or_coverage.
  • Bounds: max_draws = 100000, max_coordinates = 1024.

X2: cpdag completion scenarios

Claim: structural_envelope

  • Question: Does a target effect remain identified and invariant across every DAG completion of a supplied CPDAG when each completion receives evidence bound to its own assumptions?
  • Scope: Supplied CPDAG of at most six fully observed static nodes whose completions number at most 64, each consistent DAG completion retained separately under a canonical BLAKE3 identity over its sorted parent-child edges; selection edges and latent (bidirected) pairs are refused, never projected away. A completion is decided by the 2.2 classical catalog route with that row's scope inherited unchanged.
  • Guarantee: bounded_completion_enumeration_per_completion_2_2_decision_structural_envelope_no_graph_probability.
  • Bounds: max_nodes = 6, max_completions = 64.
  • Not an interval: the structural envelope is never a confidence interval.

X2: shared scenario covariance

Claim: point_only

  • Question: How correlated are effect estimates from identified DAG completions that reuse the same observed units?
  • Scope: No graph claim of its own: the scenario estimates are supplied plug-in functionals of one complete-row table (a linear score of per-row terms, or a stratified adjusted contrast), typically those of the identified completions of the bounded CPDAG cell. Identification of each scenario's estimand belongs to its own record.
  • Guarantee: shared_row_resampling_covariance_point_only_no_interval.
  • Bounds: max_completions = 64, max_replicates = 2000, max_exact_rows = 24, max_exact_compositions = 4000000, max_table_rows = 10000, max_table_columns = 64.

X4: joint bayesian transport

Claim: calibrated

  • Question: What target effect posterior follows from a declared joint source and target model and the supplied transport evidence?
  • Scope: The fixed DAG and selection assumptions of a separately licensed 2.2 transport derivation; no ADMG or graph-class posterior in this cell.
  • Guarantee: original_native_method_replay_exact_scoped_measured_scalar_authorization.
  • Bounds: max_draws = 100000, max_model_parameters = 256.
  • Interval scope: Named target_effect95 only, source sizes150..600 each; four original known-variance joint Gaussian configurations, isotropic variance1000 declared prior,4096 draws, frozen balanced independent source/target design and original native identification. Parameters, covariance, diagnostics and draws keep model-conditional/unmeasured source standing.

X4: binary nested markov pilot

Claim: calibrated

  • Question: Can one bounded binary ADMG transport functional be evaluated through a correctly normalized nested-Markov likelihood?
  • Scope: Exactly the Verma ADMG X1 -> X2 -> X3 -> X4, X2 <-> X4 over four binary observed variables (at most 6 observed variables admitted by the scope check, only this graph fits); every other ADMG, regime or non-binary domain is outside the pilot and refuses.
  • Guarantee: original_native_method_replay_exact_scoped_measured_scalar_authorization.
  • Bounds: max_observed = 6, max_iterations = 1000000.
  • Interval scope: Named mean0/mean1/contrast95, n2000..8000 positive integer IID multinomial counts on original selected binary Verma ADMG; original licensed generalID/interior point eligibility, default fit; all11 Beta(1,1) OR all11 Beta(2,2),4chains2048warmup4096draws5Mproposals, fixed rank/folded Rhat<=1.01 and bulk/tailESS>=400 all14. Conditional proper posterior and finite chosen validation designs, no universal model guarantee.

X5: dependent temporal interval

Claim: calibrated

  • Question: What sampling interval surrounds a target two-step sequence effect when observations share a repeated unit?
  • Scope: The fixed two-slice selection ADMG and horizon-two query of the licensed 2.2 temporal transport cell; no longer sequence.
  • Guarantee: original_native_method_replay_exact_scoped_measured_scalar_authorization.
  • Bounds: max_horizon = 2, max_replicates = 2000, max_units = 100000.
  • Interval scope: Direct two-step response under explicit initial law(.3,.7), sequence(0,0), complete binary histories, n75..200, whole-unit studentized B500, min_units20, max_failed_fraction.05 and level.95 only. Checked session methods have separate ownership in temporal_recalculation.

X5: uncertain initial state

Claim: point_only

  • Question: How does uncertainty in the pre-action state change the two-step target response?
  • Scope: The 2.2 fixed two-slice selection ADMG, with one finite observed pre-action state.
  • Guarantee: point_marginalization_over_supplied_target_initial_state_law_exact_finite_sum.
  • Bounds: max_initial_states = 64, max_horizon = 2.

X5: new period refresh

Claim: point_only

  • Question: Can a prepared two-step result accept a new observation period without reusing stale time or selection premises?
  • Scope: The 2.2 fixed two-slice graph when the window advances without extending horizon; a third slice requires a separate cell.
  • Guarantee: semantic_refresh_identity_decision_and_receipt_point_only.
  • Bounds: max_horizon = 2, max_history_states = 4096.

X8: temporal fixed population counterfactual

Claim: point_only

  • Question: What would the same observed unit's final outcome have been under a different two-step action history?
  • Scope: Fully observed two-slice Markovian temporal DAG with one ordered action per slice and one final outcome; no latent confounding.
  • Guarantee: shared_exogenous_history_counterfactual_linear_additive_noise_point_only.
  • Bounds: max_horizon = 2, max_units = 100000.

X8: transported path specific counterfactual

Claim: point_only

  • Question: Can a static path-specific counterfactual answer be transported to a named target using a checked source-to-target derivation?
  • Scope: A selected static fully observed Markovian DAG with a finite source/target selection diagram, inside the intersection of the two 2.2 prerequisite graph classes; no ADMG or temporal path-specific claim.
  • Guarantee: composition_closed_joint_theorem_not_derived_gate_reports_missing_prerequisites_only.
  • Bounds: none declared.

X10: sampled observation recovery

Claim: calibrated

  • Question: What sampling uncertainty surrounds an effect computed from the exact binary observation-recovery formula?
  • Scope: The binary m-graph class and exact recoverable effect query of the licensed 2.2 X10 row, with at most 6 binary substantive variables; the recovery derivation is re-checked by the identification engine, and adjacent or non-recoverable m-graphs refuse. Other missingness graphs need separate formulas.
  • Guarantee: original_native_method_replay_exact_scoped_measured_scalar_authorization.
  • Bounds: min_replicates = 2000, max_replicates = 2000, max_rows = 1000000, max_binary_variables = 6.
  • Interval scope: Named recovered_effect95,n1000..4000,unweighted IID whole rows under exact original native six-role binary missingness derivation/effect, B2000 BCa, exact compressed all-row delete-one acceleration,strict half-tie z0, zero failed replicates,normalizationtol.1,smallcell5,treatment1/control0. Exact verified source-label identity alias only; scientific graph/effect/row sampling/weights changes refuse or distinct basis.

F16: distribution meanings

Claim: point_only

  • Question: Can a consumer refuse a distribution whose draws represent the wrong random quantity before evaluating it?
  • Scope: A previously identified claim, whose graph and proof are checked outside this representation cell.
  • Guarantee: checked_distribution_meaning_operation_compatibility_only_no_identification_or_calibration.
  • Bounds: none declared.

F1: aligned joint draws

Claim: point_only

  • Question: Can a fresh consumer recover the same joint covariance and nonlinear functional from exported, aligned multivariate draws?
  • Scope: An already identified finite-coordinate claim; this representation cannot establish a graph theorem.
  • Guarantee: checked_finite_joint_draw_values_and_artifact_identity_only.
  • Bounds: max_draws = 100000, max_coordinates = 1024, max_payload_bytes = 16777216.

F19: mapped posterior transfer

Claim: point_only

  • Question: Can a posterior over named coefficients become a prior for a changed design without losing covariance, identities or residual-variance meaning?
  • Scope: A fixed identified Gaussian linear design with stable named coefficient identities; causal identification belongs to the source and target claims.
  • Guarantee: checked_named_known_variance_point_transfer_with_dense_covariance.
  • Bounds: max_draws = 100000, max_coordinates = 1024, max_payload_bytes = 16777216.

F2: external scientific providers

Claim: none

  • Question: Can typed external law and posterior provider contracts be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: typed_provider_contract_declaration_only_no_causal_or_interval_claim.
  • Bounds: none declared.

F3: external response binding

Claim: point_only

  • Question: Can checked external result binding be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: checked_external_response_binding_point_only_no_interval_no_native_claim.
  • Bounds: none declared.

F20: provider capability negotiation

Claim: none

  • Question: Can provider capability negotiation be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: exact_operation_negotiation_only_no_approximation_license.
  • Bounds: none declared.

F22: external object verification

Claim: none

  • Question: Can object-level exact-request verification be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: object_verification_at_exact_request_fingerprint_only_not_general_trust.
  • Bounds: none declared.

F23: external trust receipt

Claim: none

  • Question: Can external trust and provenance boundary be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: trust_tier_preserved_without_upgrade_never_native_licensed.
  • Bounds: none declared.

F8: coordinate support

Claim: none

  • Question: Can finite coordinate support be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: per_coordinate_support_labels_and_worst_label_summary_only.
  • Bounds: none declared.

F24: composition provenance

Claim: none

  • Question: Can composition provenance chain be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: ordered_predecessor_digest_lineage_only_no_causal_or_interval_claim.
  • Bounds: none declared.

F25: structured refusals

Claim: none

  • Question: Can structured cross-stage refusals be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: typed_refusal_envelope_validated_and_preserved_across_surfaces_only.
  • Bounds: none declared.

F21: composition parity

Claim: none

  • Question: Can Rust and Python composition parity be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: cross_language_joint_law_parity_point_only_no_interval.
  • Bounds: none declared.

F18: temporal effect constancy

Claim: point_only

  • Question: Can effect constancy across a declared time partition be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: global_effect_heterogeneity_test_under_frozen_null_point_only_non_rejection_never_proves_constancy.
  • Bounds: max_partitions = 1024.

X2: scenario invariance report

Claim: structural_envelope

  • Question: For each scenario of a finite transport scenario set, which selection differences does it assume, which invariances does its identified formula rely on, and what stands behind each extreme of the range over scenarios?
  • Scope: The static selection diagrams the 2.2 classical catalog transport route decides (fully observed static nodes with directed and bidirected edges and selection targets); a non-static node refuses. Scope is inherited unchanged from that route.
  • Guarantee: report_read_from_the_verified_derivation_selection_differences_invariances_obstruction_structural_no_new_decision.
  • Bounds: max_scenarios = 64.
  • Not an interval: the structural envelope is never a confidence interval.

X8: transported additive counterfactual

Claim: point_only

  • Question: Can a static path-specific counterfactual contrast (a natural direct or indirect effect, or any edge assignment) be transported to a named target population under a stated affine additive-noise structural class?
  • Scope: Static fully observed Markovian DAG with affine additive-noise mechanisms and selection only on covariates or the treatment; no latent confounding, no selection on a mediator or outcome mechanism, no temporal structure.
  • Guarantee: affine_additive_markovian_class_target_contrast_sum_over_target_covariate_law_declared_noise_premises_point_only.
  • Bounds: max_covariates = 64, max_mechanisms = 256, max_support_points = 65536, max_declarations = 256, max_artifact_bytes = 67108864.

X4: learned joint transport

Claim: calibrated

  • Question: What target effect posterior follows from a declared joint source and target model whose outcome mechanism is fitted through the antecedent-learn polynomial basis provider?
  • Scope: The fixed DAG and selection assumptions of a separately licensed 2.2 transport derivation (direct or baseline standardization); an ADMG or a graph posterior refuses.
  • Guarantee: original_native_method_replay_exact_scoped_measured_scalar_authorization.
  • Bounds: max_draws = 100000, max_model_parameters = 256, max_basis_degree = 6.
  • Interval scope: Same four original joint configurations and sample/design protocol, degree2 learned polynomial basis only with retained original provider; target_effect95 only. Degree3, arbitrary basis/provider and priors remain unsupported.

X4: binary nested markov fisher

Claim: calibrated

  • Question: Can the selected binary nested-Markov model propagate its entire constrained likelihood covariance into both intervention means and their contrast?
  • Scope: Exactly the Verma ADMG X1 -> X2 -> X3 -> X4, X2 <-> X4 over four binary observed variables (at most 6 observed variables admitted by the scope check, only this graph fits); every other ADMG, regime or non-binary domain is outside the pilot and refuses.
  • Guarantee: original_native_method_replay_exact_scoped_measured_scalar_authorization.
  • Bounds: max_observed = 6, max_iterations = 1000000.
  • Interval scope: Named mean0/mean1/contrast95, n1000..4000 positive integer IID counts on original selected binary Verma ADMG; original licensed ID/default interior fit, full expected-Fisher/delta covariance. Only 95% is supported; no posterior or simultaneous interval claim.

F15: native authority boundary

Claim: point_only

  • Question: Can caller-supplied arrays or historical trust labels acquire native execution authority?
  • Scope: A previously identified, finite coordinate causal claim; graph identification belongs to its prerequisite record.
  • Guarantee: generic_distribution_labels_never_mint_native_execution_authority.
  • Bounds: max_draws = 100000, max_coordinates = 1024.

F18: effect constancy consumers

Claim: point_only

  • Question: Can independently verified original effect-constancy evidence feed real transport review, prior-source filtering/ranking and affine point-policy comparisons without changing its uncertainty standing?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: original_constancy_evidence_real_downstream_advisory_consumers_no_inference_upgrade.
  • Bounds: max_partitions = 1024, max_catalog_sources = 1024, max_actions = 64, max_inputs = 16, max_utility_nodes = 2048, max_utility_depth = 64, max_artifact_bytes = 67108864, max_prior_artifact_bytes = 16777216.

A0: source evidence

Claim: point_only

  • Question: Can actual original source diagnostics and semantic lineage survive decisions and inverse artifacts without conflating recognition with verification or importing native execution authority?
  • Scope: Original native response graph and checked identification are preserved; no new identification license.
  • Guarantee: original_scoped_diagnostics_and_actual_native_operation_resolution_without_authority_upgrade.
  • Bounds: max_artifact_bytes = 16777216, max_logical_bytes = 16777216, max_projection_bytes = 1048576, max_actions = 4096.

A0: composition source lineage

Claim: point_only

  • Question: Can finite-law functional requests retain original diagnostics, full law rows and scientifically named contributors through independent replay without importing native authority?
  • Scope: Original checked native/source graphs retained; generic finite-law declarations retain their original declared provenance.
  • Guarantee: original_source_ancestry_and_complete_scientific_request_replay_without_authority_upgrade (complete only scientific request replay without authority upgrade; sampling interval not offered).
  • Bounds: max_functional_artifact_bytes = 16777216.

A0: sensitivity source lineage

Claim: point_only

  • Question: Can a sensitivity surface retain and independently replay its full original v3 source baseline, proof, laws and condition before publishing source lineage?
  • Scope: Original checked native/source graphs retained; generic finite-law declarations retain their original declared provenance.
  • Guarantee: original_source_ancestry_and_complete_scientific_request_replay_without_authority_upgrade (complete only scientific request replay without authority upgrade; sampling interval not offered).
  • Bounds: max_artifact_bytes = 16777216.

2.3B cells

F4: decision contract

Claim: point_only

  • Question: Can durable decision contracts be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: checked_decision_contract_expected_utility_and_hard_constraint_exclusion_point_only.
  • Bounds: max_actions = 1024, max_inputs = 256, max_utility_depth = 64, max_effect_unit_bytes = 256.

F5: decision functionals

Claim: point_only

  • Question: Can typed expectation, probability and quantile functionals be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: typed_functionals_on_aligned_finite_laws_with_stated_conventions_point_only.
  • Bounds: max_actions = 1024, max_inputs = 256, max_utility_depth = 64.

F6: structural decision policy

Claim: point_only

  • Question: Can structural decision policy and robustness be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: declared_structural_policies_over_supplied_structures_point_only.
  • Bounds: none declared.

F9: evidence obligations

Claim: none

  • Question: Can machine-readable evidence obligations be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: typed_evidence_obligations_with_exact_population_regime_variables_and_proof_step_a_request_never_a_verdict_no_claim.
  • Bounds: max_coordinates = 1024.

F10: study candidate

Claim: none

  • Question: Can durable study candidate be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: durable_study_candidate_declares_expected_evidence_with_sample_timing_unit_and_cost_identities_never_claims_evidence_it_cannot_collect_no_claim.
  • Bounds: none declared.

F13: identification repair

Claim: none

  • Question: Can theorem-scoped identification repair facade be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: theorem_scoped_repair_classification_by_each_family_checker_with_budgeted_subset_search_exhaustion_never_impossibility_no_claim.
  • Bounds: max_candidates = 16, max_subset_size = 4, max_operations = 100000, max_memory_bytes = 268435456.

F13: repair search receipt

Claim: none

  • Question: Can a stored repair search receipt be replayed by a fresh consumer under its own bounds?
  • Scope: A back-door or classical transport contract over a graph on dense static variables 0..n; other graphs are not exportable.
  • Guarantee: replayable_repair_search_receipt_recomputed_by_the_family_checker_from_the_stored_delta_no_claim.
  • Bounds: none declared.

X4: dose grid functional

Claim: point_only

  • Question: What are the level, derivative or contrast of a randomized-dose response curve at named doses, and where is the data too thin to say?
  • Scope: A randomized dose, attested by the caller: the dose is independent of the potential-outcome process, so no adjustment is needed. An observational dose is refused (dose_grid.graph_not_certified); this row does not adjust and re-derives no graph.
  • Guarantee: randomized_dose_gaussian_local_quadratic_named_functional_point_values_with_per_dose_support_pointwise_calibration_unmeasured_band_closed.
  • Bounds: none declared.

X10: chain observation recovery

Claim: point_only

  • Question: Is the full law P(X1, X2) of two binary variables recoverable from the observed pattern law when one response indicator causes the other, and if self-censoring forbids it, is there an exact witness?
  • Scope: A two-variable binary m-graph: optional X1-X2 edge, proxy wiring X_i -> X*_i <- R_i, exactly one response edge R_h -> R_t and optionally X_h -> R_t; no bidirected edge and no other edge. A self-censoring edge is nonrecoverable with a witness; every other graph is route_not_supported. The 2.2 row, which refuses every R -> R edge, is unchanged.
  • Guarantee: exact_ordered_response_recovery_of_a_two_variable_binary_mgraph_with_a_verified_nonrecoverability_witness_point_values_only.
  • Bounds: none declared.

F11: external signal

Claim: point_only

  • Question: Can external candidate signal and update be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: checked_signal_request_receipt_and_posterior_update_with_external_trust_never_native_point_only.
  • Bounds: none declared.

F12: evsi

Claim: point_only

  • Question: Can preposterior EVSI and cost mapping be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: exact_integration_evsi_evpi_and_net_value_under_declared_cost_map_point_only_monte_carlo_error_and_rank_uncertainty_unlicensed_diagnostics.
  • Bounds: none declared.

F14: design ranking artifact

Claim: point_only

  • Question: Can portable design ranking artifact be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: sealed_design_ranking_with_graded_replay_native_exact_recomputed_external_values_retained_as_attested_point_only.
  • Bounds: none declared.

F17: sensitivity decision composition

Claim: point_only

  • Question: Can sensitivity result in durable decisions be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: assumption_dependent_decision_over_declared_grid_points_only_range_never_probability_point_only.
  • Bounds: none declared.

F7: functional inverse query

Claim: point_only

  • Question: Can generalized finite inverse decision query be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: finite_declared_grid_inverse_query_with_distinct_feasibility_fields_point_only_no_global_feasibility.
  • Bounds: none declared.

F4: admissibility and support requirements

Claim: point_only

  • Question: Can declared admissibility rules, per-input support rules and an uncertainty requirement be consumed as part of a durable decision contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: declared_admissibility_support_and_uncertainty_requirements_remove_actions_never_penalize_point_only.
  • Bounds: none declared.

F6: structural robustness and adapters

Claim: point_only

  • Question: Can structural claims (point, graph-dependent, weighted graph atoms, finite scenarios) and identified-set partial identification be adapted into a decision under a declared policy?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: claim_adapters_and_identified_set_decisions_over_supplied_sets_no_probability_no_coverage_point_only.
  • Bounds: none declared.

F6: robust verdicts and result artifact

Claim: point_only

  • Question: Can the robustness verdict of a decision under structural uncertainty, and its replayable result with retained external-callback receipts, be consumed under a checked semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: robustness_verdicts_over_supplied_structures_with_replayable_result_and_retained_external_receipts_point_only.
  • Bounds: none declared.

X6: prior signal decision planning

Claim: point_only

  • Question: Can a prior bank and a candidate signal be combined into a checked decision-planning input under a declared semantic contract?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: checked_prior_to_candidate_signal_adaptation_with_declared_pooling_and_observation_reuse_refusal_point_only.
  • Bounds: none declared.

B4: vector treatment coefficients

Claim: point_only

  • Question: Can the joint coefficients of several treatments estimated together on one adjustment set and one row snapshot be consumed with their full covariance under a checked semantic contract?
  • Scope: No graph is identified or checked: the caller owns that the shared adjustment set is valid for every treatment. The route reports regression coefficients of the declared design.
  • Guarantee: joint_ols_treatment_coefficients_with_full_covariance_point_only_standard_errors_and_p_values_unmeasured_diagnostics.
  • Bounds: max_treatments = 64, hc_replay_row_cap = 4096.

B4: categorical treatment contrasts

Claim: point_only

  • Question: Can level-versus-reference and pairwise contrasts of a categorical (ordered or unordered) treatment, with an omnibus test and a declared monotonicity test, be consumed under a checked semantic contract?
  • Scope: No graph is identified or checked: the caller owns that the declared adjustment set is valid for the categorical treatment.
  • Guarantee: categorical_treatment_level_and_pairwise_contrasts_point_only_tests_and_standard_errors_unmeasured_diagnostics.
  • Bounds: hc_replay_row_cap = 4096.

B4: compact runtime export

Claim: point_only

  • Question: Can a fitted linear-in-coefficients effect model be exported as a compact, identity-bound runtime object that evaluates a point prediction only inside its declared support and outside its refusal mask?
  • Scope: No graph is identified: the export carries whatever coefficients and covariance it is given and only checks their shape, finiteness and positive semidefiniteness.
  • Guarantee: compact_export_point_prediction_inside_declared_support_point_only_model_based_se_unmeasured_diagnostic.
  • Bounds: none declared.

B4: nonlinear mediation

Claim: point_only

  • Question: Can natural direct and indirect effects of a binary treatment through a continuous mediator with a nonlinear outcome be consumed under a checked semantic contract, with the interventional estimand refused?
  • Scope: Binary treatment, one continuous mediator and measured covariates under declared sequential ignorability, cross-world independence and no treatment-induced mediator-outcome confounding; these are declared premises recorded as declared, never verified.
  • Guarantee: nonlinear_mediation_natural_effects_point_only_bootstrap_se_unmeasured_diagnostic_interval_closed.
  • Bounds: none declared.

B4: latent class effects

Claim: point_only

  • Question: Can per-class treatment effects of a K-class finite mixture of linear outcome models be consumed under a checked semantic contract?
  • Scope: Treatment is as-if randomized within each latent class given the measured covariates; this is a declared premise, recorded as declared and never verified. No graph is identified.
  • Guarantee: latent_class_effects_point_only_local_em_maximum_standard_errors_unmeasured_diagnostics.
  • Bounds: max_classes = 4.

F6: scenario claims adapters

Claim: point_only

  • Question: Can the real 2.2 scenario, weighted-scenario and CPDAG-completion reports be adapted into decision atoms and per-action identified-set intervals without renormalizing unresolved mass or reading completion counts as probabilities?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; each scenario or completion keeps the status the 2.2 report gave it and this adapter does not identify a graph.
  • Guarantee: scenario_and_completion_reports_adapted_to_atoms_and_intervals_unrenormalized_counts_never_probabilities_point_only.
  • Bounds: none declared.

X6: proposal receipt

Claim: point_only

  • Question: Can the evidence a failed identification contract owes be linked, per proposed study, to the design ranking that values that study, with a verifiable bundle and a re-identification on arrived evidence that never treats a hypothetical derivation as available evidence?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract (the failed back-door or transport contract of the repair); this receipt does not identify a graph and does not execute a study.
  • Guarantee: per_proposal_receipt_binds_repair_and_ranking_by_identity_hypothetical_never_evidence_family_checker_on_arrival_point_only.
  • Bounds: none declared.

B3: mechanism discrepancy diagnostic

Claim: point_only

  • Question: Do an independent source sample and an independent target sample, measured on comparable scales, show a detectable difference between the linear conditional mechanism of one node given its parents, and which coefficient differences could this comparison have detected?
  • Scope: No graph is identified: the diagnostic compares the linear conditional mechanism of one declared node given its declared parents between two samples; it informs only a selection node on that node and does not identify, orient or test a graph.
  • Guarantee: asymptotic_wald_discrepancy_diagnostic_non_rejection_never_certifies_invariance_point_only_error_rates_unmeasured.
  • Bounds: max_bytes = 16777216.

B3: msm sensitivity

Claim: point_only

  • Question: How far can the stratified average treatment effect move if unmeasured confounding shifts the odds of treatment by a factor within [1/Lambda, Lambda], at which Lambda does it cross a decision threshold, and which action does the F17 decision composition choose over the declared Lambda range, with the sampling interval kept withheld?
  • Scope: No graph is identified: the caller supplies an adjustment set as finite strata with exact masses, propensities and outcome laws, and the sensitivity model perturbs the treatment odds given the strata and the potential outcome.
  • Guarantee: msm_sharp_assumption_range_exact_population_inputs_lambda_one_identified_sampling_interval_withheld_point_only.
  • Bounds: max_strata = 4096, max_grid_points = 1024, max_sample_rows = 1000000, max_outcomes_per_arm = 256.

X4: quadratic dose functional

Claim: point_only

  • Question: What is the randomized-dose level, derivative or contrast under a declared exact quadratic conditional mean, with zero smoothing bias at fixed bandwidth?
  • Scope: A randomized dose, attested by the caller: the dose is independent of the potential-outcome process, so no adjustment is needed. An observational dose is refused (dose_grid.graph_not_certified); this row does not adjust and re-derives no graph.
  • Guarantee: declared_exact_quadratic_mean_zero_smoothing_bias_point_only.
  • Bounds: none declared.

X6: proposal arrival

Claim: point_only

  • Question: Can an actual independent finite study arrival, tied to the planned sample size and original physical/proof coordinates, execute the original checked transport/z-transport evaluator and independently replay from original artifacts and complete raw count providers?
  • Scope: Original failed classical catalog transport or checked missing-evidence z-transport selection ADMG; no new graph identifier or arbitrary analysis callback.
  • Guarantee: original_checked_transport_program_executes_actual_count_laws_and_replays_all_raw_providers_point_only.
  • Bounds: max_artifact_bytes = 33554432, max_laws = 64, max_cells_per_law = 65536, max_variables = 12, default_evaluation_operations = 100000, default_evaluation_depth = 128, max_evaluation_operations = 1000000, max_evaluation_depth = 256.

X7: Conditional accelerator lane

The conditional accelerator package is carried forward under the explicit X7 decision below. Its start condition remains unmet; no accelerator implementation or performance claim is included in 2.3.

2.3C cells

C1: program binding

Claim: point_only

  • Question: Can an external claim be bound to the actual identified program and request it answers, so that a graph-only identity, an incompatible quantities override, a treatment or outcome substitution, a population mismatch or a dose-grid change is refused?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this binding cell does not identify a graph and does not execute or estimate anything.
  • Guarantee: external_claim_bound_to_full_identified_program_and_request_identity_point_only_no_native_upgrade.
  • Bounds: none declared.

C1: native response claims

Claim: point_only

  • Question: Can a native mean-curve response be consumed by decision and inverse flows as a typed claim whose scientific coordinates, support, trust and calibration travel with it, without a mean ever becoming an outcome law?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this adapter does not identify a graph and does not estimate the response.
  • Guarantee: native_mean_response_as_typed_claim_with_coordinates_support_trust_never_an_outcome_law_point_only.
  • Bounds: none declared.

C1: composition boundary

Claim: point_only

  • Question: Can a decision input carry its support, trust, calibration and capabilities from evidence only, can each action be judged on its own coordinates, and can sources be combined only under a declared operation that refuses shared or unknown dependence?
  • Scope: Only an independently identified fixed-graph or declared structural-scenario contract; this composition cell does not identify a graph.
  • Guarantee: decision_input_trust_from_evidence_only_per_action_support_and_declared_dependence_boundary_point_only.
  • Bounds: none declared.

C2: selective recalculation

Claim: point_only

  • Question: Can a causal workflow be recalculated selectively, reusing the stage artifacts whose declared inputs and upstream identities are unchanged, recomputing only what changed, refusing what a fresh process cannot supply, and proving the reuse by counted cross-fitted fold fits rather than by the plan alone?
  • Scope: No new graph is identified: the planner compares declared stage identities, and the executor runs the existing identify-and-estimate route for a binary treatment under the caller's accepted graph and adjustment set. The retarget licence and the declared inputs are caller declarations, recorded and never verified here.
  • Guarantee: selective_recalculation_stage_plan_and_counted_fold_fit_reuse_point_only_no_interval_no_persistent_cache.
  • Bounds: max_external_branches = 8.

C2: recalc receipt artifact

Claim: point_only

  • Question: Can the receipt of a selective recalculation be exported as a portable, identity-bound artifact that a fresh consumer verifies by recomputing the plan, and that never certifies cache reuse across a process boundary?
  • Scope: No graph is identified: the artifact carries stage identities and counts for a workflow and checks their consistency with the planner only.
  • Guarantee: recalc_receipt_artifact_recomputed_plan_and_counts_no_fresh_process_reuse_point_only_no_interval.
  • Bounds: max_bytes = 262144, max_stages = 64.

C3: composition bundle

Claim: point_only

  • Question: Can a composed decision be exported as one portable bundle of typed nodes and Merkle-bound edges that an independent consumer verifies node by node, labels point-only or joint-draw from ancestor facts, and never claims to have replayed a referenced provider or study?
  • Scope: No graph is identified. The bundle's own graph is the dependency graph of its nodes; the causal contract or program a node carries is verified only to the extent its own artifact consumer verifies it, and a bundle never claims that a serialized result recreates an executable study.
  • Guarantee: portable_composed_result_merkle_bound_nodes_verified_by_per_kind_verifiers_references_never_replayed_point_only.
  • Bounds: max_nodes = 1024, max_edges = 8192.

C3: composition verifiers

Claim: point_only

  • Question: Can each embedded artifact of a composition bundle be verified through that artifact's own consumer, publishing the binding facts from the decoded fields, with external mean decisions kept point-only attested and joint-draw decisions kept to the aligned-law requirement?
  • Scope: No graph is identified: a verifier checks one artifact against its declared neighbours; the graph, snapshot or contract an artifact states is compared, not discovered.
  • Guarantee: per_kind_node_verifiers_through_own_consumers_facts_from_decoded_fields_external_mean_point_only_attested.
  • Bounds: none declared.

C4: multi source acceptance

Claim: point_only

  • Question: Can one decision over a three-action program be answered from a native response claim and two external studies, with each action's support reported, shared data and overlapping evidence refused as independent, a design ranked, the whole composed into one portable bundle, and every mutation of a binding fact either refused or recalculated only where it matters?
  • Scope: Graph x -> a, x -> y, a -> y with program y under do(a) over a three-dose grid. The acceptance identifies nothing itself: the program binding, the native claim and the external bindings each carry their own graph facts, and a changed graph or premise is refused at the program binding.
  • Guarantee: multi_source_acceptance_composed_only_from_licensed_routes_hand_derived_values_refusals_and_selective_recalculation_point_only.
  • Bounds: none declared.

C2: cell recalc and frozen scores

Claim: point_only

  • Question: Can the cell-saturated AIPW route be recalculated selectively with the fits counted by the estimator's own instrument, and can a fresh session resume from a frozen-score artifact alone and retarget it with zero fits while refusing everything that needs data or a fit?
  • Scope: No new graph is identified: the planner compares declared stage identities and the executor runs the existing cell-saturated AIPW estimator for jointly intervened binary treatments under the caller's graph and declared adjustment set, screened against descendants of the treatments. The retarget licence and the declared inputs are caller declarations, recorded and never verified here.
  • Guarantee: cell_recalculation_and_portable_score_resume_counted_fits_zero_fit_retarget_point_only_no_interval.
  • Bounds: none declared.

C2: frozen scores artifact

Claim: point_only

  • Question: Can the frozen cross-fitted or cell AIPW score table of one run be exported as a portable, identity-bound artifact that a fresh consumer verifies by recomputing its fit identity and artifact identity and that carries scores but no data and no model?
  • Scope: No graph is identified: the artifact carries scores and stage identities for one workflow and checks their consistency only.
  • Guarantee: frozen_score_artifact_recomputed_fit_and_artifact_identity_bit_exact_scores_no_data_no_model_point_only_no_interval.
  • Bounds: max_bytes = 134217728, max_rows = 2097152, max_columns = 64.

C2: operation capability inventory

Claim: none

  • Question: Which declared recalculation operation has a real adapter for the actual retained state, and which remains explicitly unavailable?
  • Scope: No graph is identified by inventory inspection.
  • Guarantee: six_family_ten_operation_retained_state_capability_inspection_no_execution_no_numeric_claim.
  • Bounds: max_external_branches = 8.

C2: adjusted recalculation

Claim: point_only

  • Question: Can checked adjusted regression retain its actual fit and covariance for supported contrasts, fixed-row target standardization, utility changes and point predictions, while invalidating changed model/data/causal roles and explaining real work?
  • Scope: Fully observed static DAG; one or multiple joint treatment roles, one outcome and a checked common adjustment set. No latent graph, temporal regime or external provider is licensed.
  • Guarantee: checked_adjusted_fit_reuse_counted_model_solves_full_covariance_supported_mean_contrasts_point_only.
  • Bounds: max_rows = 100000, max_columns = 256, max_values = 1000000, max_glm_iterations = 1000, max_json_bytes = 1048576.

C2: dr recalculation

Claim: point_only

  • Question: Can checked DML AIPW and DR-Learner retain their own marginal scores and CATE model for compatible target/utility operations and point prediction, while measuring actual work and refusing unavailable state?
  • Scope: Fully observed static DAG, one binary treatment and mean outcome, checked adjustment-shaped identification. No latent, temporal, design-specific or external provider contract.
  • Guarantee: checked_dr_score_and_cate_reuse_actual_learner_counts_point_only.
  • Bounds: max_rows = 100000, max_columns = 256, max_values = 1000000, max_json_bytes = 1048576, max_folds = 20.

C2: static recalculation

Claim: point_only

  • Question: Can the checked static analysis retain compatible executed state, invalidate only changed scientific dependencies, and independently consume its results?
  • Scope: Finite identified ADMG response grids and bounded multi-source transport with exact discrete source laws.
  • Guarantee: checked_static_reuse_actual_work_point_only.
  • Bounds: max_rows = 100000, max_values = 1000000, max_factor_cells = 1000000, max_variables = 12, max_levels_per_axis = 64, min_support_points = 2, max_support_points = 64, max_selected_actions = 64.

C2: design recalculation

Claim: point_only

  • Question: Can the checked design analysis retain compatible executed state, invalidate only changed scientific dependencies, and independently consume its results?
  • Scope: Existing checked IV2SLS, sharp linear RD and linear front-door design-specific study engines.
  • Guarantee: checked_design_reuse_actual_work_point_only.
  • Bounds: max_rows = 100000, max_values = 1000000.

C2: bayesian recalculation

Claim: point_only

  • Question: Can the original checked bayesian engine retain compatible executed state and independently replay its actual scientific result?
  • Scope: Observed fixed DAG with the original Gaussian linear or declared quadratic-basis causal ATE engine; bounded coefficient prior, known residual variance or NIG as supported by the original engine.
  • Guarantee: checked_bayesian_retention_actual_work_no_new_inference_guarantee.
  • Bounds: max_rows = 100000, max_values = 1000000, max_variables = 128, min_draws = 2, max_draws = 100000, max_workspace_values = 16000000, max_prior_artifact_bytes = 16000000.

C2: temporal recalculation

Claim: calibrated

  • Question: Can the original checked temporal engine retain compatible executed state and independently replay its actual scientific result?
  • Scope: Observed five-variable binary longitudinal DAG S0,A1,L2,A2,Y; selection confined to unconfounded root S0, invariant remaining mechanisms, two actual intervention periods.
  • Guarantee: checked_temporal_retention_and_exact_scoped_measured_scalar_authorization.
  • Bounds: max_variables = 5, max_periods = 2, max_units_rust = 8192, max_units_python = 4096, max_histories_rust = 131072, max_histories_python = 100000, max_source_support_rows = 4096.
  • Interval scope: Original checked source/proof and both effect arms retained. Exact n64..256, complete16 UNIQUE binary histories, initial law(.3,.7), B500,min_units20,max_failed_fraction.05; original unmeasured source receipt is not upgraded. Only the named response studentized or paired effect method-specific95 endpoints resolve these records.

C3: rollout state binding

Claim: point_only

  • Question: Can a fresh consumer establish that a study ranking used the actual supplied finite state law and exact terminal decision, retaining the source trust and uncertainty standing?
  • Scope: No new identification claim; the independently supplied state law retains its own scientific scope.
  • Guarantee: actual_finite_source_prior_terminal_ranking_binding_preserves_source_standing.
  • Bounds: max_artifact_bytes = 33554432, max_states = 65536, max_quantities = 1024, max_actions = 65536, max_utility_cells = 4194304.

C2: external callback recalculation

Claim: point_only

  • Question: Can a bounded actual foreign mean callback execute only its changed declared branch, retain attested output and independently replay with a real compatible provider?
  • Scope: Caller-declared original external ProgramBinding; foreign execution does not independently identify it.
  • Guarantee: actual_bounded_foreign_mean_execution_with_attested_output_and_counted_branch_replay.
  • Bounds: max_rows = 100000, max_values = 1000000, max_variables = 64, max_actions = 64, max_model_parameters = 128, max_branches = 8, max_attempts = 256, max_artifact_bytes = 6291456, max_response_bytes = 1048576.

C4: composite recalculation

Claim: point_only

  • Question: Can one actual retained native response and two real attested providers execute a supported mean decision with one shared measured dependency receipt, selective invalidation and fresh scientific revalidation?
  • Scope: Selected finite front-door ADMG T→M→Y with T↔Y, original ordinary ID and empirical whole finite factors.
  • Guarantee: actual_native_two_provider_shared_selective_mean_execution_and_scientific_revalidation.
  • Bounds: max_native_variables = 12, max_rows = 100000, max_values = 1000000, max_actions = 64, max_utility_nodes = 2048, external_branches = 2, utility_depth_exclusive = 64.

C3: source projection

Claim: point_only

  • Question: Can original causal contracts, external attestations, scientific coordinates and affine transformations be independently replayed inside a composition bundle, with actual native source execution required to resolve dependencies?
  • Scope: Original checked source graph retained; no new identification.
  • Guarantee: original_source_replay_and_exact_affine_utility_without_execution_or_calibration_upgrade.
  • Bounds: max_artifact_bytes = 18874368, max_action_id_bytes = 256.

C4: conditional study ranking

Claim: point_only

  • Question: Can an actually executed native/two-provider point decision route explicit conditional candidate declarations through original structural study ranking and replay the full handoff against actual fresh scientific state?
  • Scope: Selected finite front-door ADMG T→M→Y with T↔Y, original ordinary ID and empirical whole finite factors.
  • Guarantee: source_bound_conditional_point_structural_ranking_and_actual_fresh_replay.
  • Bounds: max_actions = 64, max_candidates_per_action = 128, max_candidates = 512, max_name_bytes = 256, max_artifact_bytes = 4194304, max_policy_json_bytes = 262144.

C2: native execution attempts

Claim: point_only

  • Question: Can actual attempted/completed/failed native component work be inspected on an original success, refusal or cancellation without fabricating a successful receipt or losing retained scientific state?
  • Scope: Original source family graph/identification contracts unchanged; observer itself identifies no causal graph.
  • Guarantee: actual_original_component_lifecycle_diagnostics_without_authority_or_retry.
  • Bounds: none declared.

Carried forward

X7 (GPU lane) remains carried forward. The CPU-only whole-workload baseline (benches/baselines/neural_crossfit.md) supplies no same-host accelerator comparison; no GPU backend is available. The required measured gain and distribution gates remain open. See the explicit decision in parity/2_3_x7_decision.md.

Explicit refusals

A result is available only at its declared scientific and support coordinate. Unidentified contracts, incompatible units, quantities, populations or regimes, insufficient support, overlapping evidence and an unavailable provider capability produce structured refusals. A mean contrast does not supply absolute potential-outcome means, a probability, a quantile or a joint law. Structural sufficiency ranking does not supply an identification probability. Recalculation requires the original retained execution state and a supported analysis family; an imported artifact alone does not restore that state.

Joint and learned joint Gaussian transport, nested-Markov Bayesian and Fisher inference, temporal intervals and sampled recovery require passing evidence for the exact method, prior, protocol, scalar and sample-size scope. Unsupported settings, stale evidence and source mismatches refuse. The measured result licenses only its named scalar endpoints; the underlying source artifact's parameter summaries and diagnostics retain their original meaning. Temporal responses support studentized intervals; sampled recovery supports BCa intervals. Checked paired effects support their separately measured studentized, percentile and basic constructions.

Direct decisions from prediction.FittedEffectModel and general transported nested/path-specific counterfactuals remain unsupported in 2.3. The native-analysis decision path and the restricted affine-additive transported contrast have their own narrower boundaries. The 2.4 roadmap assigns the missing implementations, dependencies and acceptance evidence; neither alternative is marked delivered by its supported neighbor.

See the support matrix for exact coordinates and reasons.

Analysis support changes since 2.2

This delta covers the generic analysis grid. The typed workflow additions above have their own support contracts.

Changes to generic analysis support since 2.2.0: 0 added coordinates, 0 removed coordinates.

The generic analysis grid is unchanged. The new typed workflows and method-specific inference scopes are described above; they do not expand this grid.

See the support matrix for the complete current inventory and interval standing.

F15: measured scalar source replay

Claim: point_only

  • Question: Can a fresh consumer independently replay the original native source and verify current method-specific scalar evidence without trusting a serialized coverage assertion?
  • Scope: Exactly the graph classes of the six method prerequisites; the carrier adds no graph support.
  • Guarantee: factory_only_original_source_replay_and_current_exact_scalar_evidence_authorization.
  • Bounds: max_bytes = 67108864.

The exported result preserves its original source. Loading it independently replays that source and verifies current evidence for each named scalar. A measured scalar result does not automatically supply the joint outcome law or decision input required by another workflow.

What's Changed

Full Changelog: v2.2.0...v2.3.0