Receipts That Move: The Transportable Proof Conjecture (TPC) — A Proposal for Verifiable Decisions
Fuente:
Zenodo
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Recurso digital |
| Pubblicazione: |
Zenodo
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866901050255998976 |
|---|---|
| author | Figurelli, Rogério |
| author_facet | Figurelli, Rogério |
| contents | <p>This paper proposes the Transportable Proof Conjecture (TPC) as a governance-first standard for carrying certainty across contexts. If a change T: A → B is admissible, an independent verifier in B should confirm the transported property quickly — without replaying A’s pipeline — using a small certificate. Admissibility is a corridor with two caps: distributional drift D(P_B, T_# P_A) ≤ η and computational curvature κ_log(T) = log L(T) ≤ κ_max. Acceptance is tuned by three dials with targets = (φ_min, τ_min, ψ_max, ε, δ): coherence φ, transportability τ, and verification time ψ. Movement is expressed in TLτ as [T]φ; NP^τ( ) labels problems whose reasons travel under a declared family . Constructively, Gen emits C_{A→B} of size poly(log n, 1/ε, log(1/δ)); Verify returns (φ_B, τ, ψ_B, status) with high probability. Composition is additive in drift and log-dilation, and certificates compose with polylog overhead. We also introduce a new hourglass metaphor: a Circle-of-Equivalence narrows the neck, but TPC decides when flow is truly portable and cheaply verifiable. Clear falsifiers (no mutual lift, admissible defeat, phase mismatch) mark where full re-testing is mandatory.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_17314075 |
| institution | Zenodo |
| language | |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Receipts That Move: The Transportable Proof Conjecture (TPC) — A Proposal for Verifiable Decisions Figurelli, Rogério transportable proof portable certificate Transportable Proof Conjecture (TPC) Circle-of-Equivalence (CoE) transport receipt auditability governance <p>This paper proposes the Transportable Proof Conjecture (TPC) as a governance-first standard for carrying certainty across contexts. If a change T: A → B is admissible, an independent verifier in B should confirm the transported property quickly — without replaying A’s pipeline — using a small certificate. Admissibility is a corridor with two caps: distributional drift D(P_B, T_# P_A) ≤ η and computational curvature κ_log(T) = log L(T) ≤ κ_max. Acceptance is tuned by three dials with targets = (φ_min, τ_min, ψ_max, ε, δ): coherence φ, transportability τ, and verification time ψ. Movement is expressed in TLτ as [T]φ; NP^τ( ) labels problems whose reasons travel under a declared family . Constructively, Gen emits C_{A→B} of size poly(log n, 1/ε, log(1/δ)); Verify returns (φ_B, τ, ψ_B, status) with high probability. Composition is additive in drift and log-dilation, and certificates compose with polylog overhead. We also introduce a new hourglass metaphor: a Circle-of-Equivalence narrows the neck, but TPC decides when flow is truly portable and cheaply verifiable. Clear falsifiers (no mutual lift, admissible defeat, phase mismatch) mark where full re-testing is mandatory.</p> |
| title | Receipts That Move: The Transportable Proof Conjecture (TPC) — A Proposal for Verifiable Decisions |
| topic | transportable proof portable certificate Transportable Proof Conjecture (TPC) Circle-of-Equivalence (CoE) transport receipt auditability governance |
| url | https://doi.org/10.5281/zenodo.17314075 |