Reduction support run pure verifier
Reduction.support_run_pure_verifier
Plain-language statement
If a reduction's verifier is a pure function f of the input statement and full transcript, then the verifier output of any complete result in the support of Reduction.run equals f stmt td applied to the input statement and the produced transcript.
Exact Lean statement
lemma Reduction.support_run_pure_verifier
{StmtIn WitIn StmtOut WitOut : Type}
{n : ℕ} {pSpec : ProtocolSpec n}
(reduction : Reduction oSpec StmtIn WitIn StmtOut WitOut pSpec)
(f : StmtIn → FullTranscript pSpec → StmtOut)
(hf : ∀ stmt td,
reduction.verifier.verify stmt td =
(pure (f stmt td) : OptionT (OracleComp oSpec) StmtOut))
(stmt : StmtIn) (wit : WitIn)
{y : Option ((FullTranscript pSpec × StmtOut × WitOut) × StmtOut)}
(hy : y ∈ support (reduction.run stmt wit).run)
{td : FullTranscript pSpec} {prv : StmtOut × WitOut} {vOut : StmtOut}
(heq : y = some ((td, prv), vOut)) : vOut = f stmt tdFormal artifact
Lean source
lemma Reduction.support_run_pure_verifier {StmtIn WitIn StmtOut WitOut : Type} {n : ℕ} {pSpec : ProtocolSpec n} (reduction : Reduction oSpec StmtIn WitIn StmtOut WitOut pSpec) (f : StmtIn → FullTranscript pSpec → StmtOut) (hf : ∀ stmt td, reduction.verifier.verify stmt td = (pure (f stmt td) : OptionT (OracleComp oSpec) StmtOut)) (stmt : StmtIn) (wit : WitIn) {y : Option ((FullTranscript pSpec × StmtOut × WitOut) × StmtOut)} (hy : y ∈ support (reduction.run stmt wit).run) {td : FullTranscript pSpec} {prv : StmtOut × WitOut} {vOut : StmtOut} (heq : y = some ((td, prv), vOut)) : vOut = f stmt td := by rw [heq] at hy unfold Reduction.run at hy simp only [OptionT.run_bind, Option.elimM] at hy rw [mem_support_bind_iff] at hy obtain ⟨proverResultOpt, _hprover, hy⟩ := hy cases proverResultOpt with | none => exfalso simp at hy | some proverResult => simp only [Option.elim_some] at hy rw [mem_support_bind_iff] at hy obtain ⟨stmtOutOpt, hstmtOutOpt, hy⟩ := hy simp only [ChallengeIdx, Challenge, Verifier.run, hf, OptionT.run_pure, liftM_pure, support_pure, Set.mem_singleton_iff] at hstmtOutOpt subst stmtOutOpt simp only [Option.elim_some, Option.getM_some, OptionT.run_pure] at hy injection hy with hpair have htd : td = proverResult.1 := congrArg Prod.fst (congrArg Prod.fst hpair) have hvOut : vOut = f stmt proverResult.1 := congrArg Prod.snd hpair rw [htd] exact hvOut- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/OracleReduction/Execution.lean:354-388
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Affine gaps lifted to interleaved codes
affine_gaps_lifted_to_interleaved_codes
Project documentation
This lemma proves the final algebraic step in the DG25 Theorem 3.1 proof. It shows that if R > e + 1, then e * (R / (R - 1)) < e + 1. The intuition is that the fraction R / (R - 1) is always greater than 1, but as R gets larger, it gets closer to 1. The hypothesis R > e + 1 provides a strong enough bound to ensure the product e * (fraction) do...
Source project: ArkLib
Person-level attribution pending.
Gadget Decompose coeff
ArkLib.Lattices.Ajtai.gadgetDecompose_coeff
Plain-language statement
The k-th coefficient (k < deg φ) of a gadget-decomposition block is exactly the corresponding digit of the corresponding input coefficient.
Source project: ArkLib
Person-level attribution pending.
Gadget Decompose lawful
ArkLib.Lattices.Ajtai.gadgetDecompose_lawful
Plain-language statement
The base-b gadget decomposition is a lawful gadget decomposition.
Source project: ArkLib
Person-level attribution pending.