All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Oracle Verifier coordinate Wise Special Sound

ReduceClaim.oracleVerifier_coordinateWiseSpecialSound

Plain-language statement

Coordinate-wise special soundness of the ReduceClaim oracle reduction. As in the non-oracle case, the verifier is pure with no challenge rounds, so CWSS collapses to a transcript-level obligation discharged by the witness pull-back mapWitInv and the compatibility hRel (identical to the RBR knowledge soundness hypothesis, mapStmt replaced by `m...

Exact Lean statement

theorem oracleVerifier_coordinateWiseSpecialSound [Nonempty WitIn]
    (D : CWSSStructure (!p[] : ProtocolSpec 0))
    (hRel : ∀ stmtIn oStmtIn witOut,
      ((mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn), witOut) ∈ relOut →
      ((stmtIn, oStmtIn), mapWitInv (stmtIn, oStmtIn) witOut) ∈ relIn) :
    (oracleVerifier oSpec mapStmt embedIdx hEq).coordinateWiseSpecialSound init impl D
      relIn relOut

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem oracleVerifier_coordinateWiseSpecialSound [Nonempty WitIn]    (D : CWSSStructure (!p[] : ProtocolSpec 0))    (hRel :  stmtIn oStmtIn witOut,      ((mapStmt stmtIn, mapOStmt embedIdx hEq oStmtIn), witOut)  relOut       ((stmtIn, oStmtIn), mapWitInv (stmtIn, oStmtIn) witOut)  relIn) :    (oracleVerifier oSpec mapStmt embedIdx hEq).coordinateWiseSpecialSound init impl D      relIn relOut := by  -- For each combined input statement, some candidate input witness works as soon as any output  -- witness makes the mapped statement accepted.  have hpick :  s : StmtIn × ( i, OStmtIn i),  witIn : WitIn,      ( witOut, ((mapStmt s.1, mapOStmt embedIdx hEq s.2), witOut)  relOut)         (s, witIn)  relIn := by    intro s    rcases or_not (p :=  witOut, ((mapStmt s.1, mapOStmt embedIdx hEq s.2), witOut)  relOut)      with witOut, hw | h    · exact mapWitInv s witOut, fun _ => hRel s.1 s.2 witOut hw    · exact Nonempty.some inferInstance, fun hex => absurd hex h  refine OracleVerifier.coordinateWiseSpecialSound_of_isEmpty_challengeIdx init impl D    (oracleVerifier oSpec mapStmt embedIdx hEq) relIn relOut    (fun s _ => (hpick s).choose) ?_  rintro stmt, oStmt tr hAcc  have hlang : (mapStmt stmt, mapOStmt embedIdx hEq oStmt)  relOut.language :=    Verifier.mem_of_pure_accepting init impl      (oracleVerifier oSpec mapStmt embedIdx hEq).toVerifier stmt, oStmt tr relOut.language _      (oracleVerifier_toVerifier_run (oSpec := oSpec)) hAcc  exact (hpick (stmt, oStmt)).choose_spec ((Set.mem_language_iff _ _).1 hlang)
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/ProofSystem/Component/ReduceClaim.lean:395-420

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

Project-declaredLean 4.31.0

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...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

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.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose lawful

ArkLib.Lattices.Ajtai.gadgetDecompose_lawful

Plain-language statement

The base-b gadget decomposition is a lawful gadget decomposition.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record