Research proof index

The expected weighted query cost of one signing attempt is the expectation of the queried commitment cost over the attempt output distribution.

Unit-cost specialization of the run formula: each signing attempt run tags its output with a single unit of cost (cf. signAttempt_run_withAddCost_eq).

Verification has expected weighted query cost equal to the cost of the single verification query when a signature is present, and 0 when the signature is none.

For a field specification 𝓕, normalOrderF is the linear map FieldOpFreeAlgebra 𝓕 →ₗ[ℂ] FieldOpFreeAlgebra 𝓕 defined by its action on the basis ofCrAnListF φs, taking ofCrAnListF φs to normalOrderSign φs • ofCrAnListF (normalOrderList φs). That is, normalOrderF normal-orders the field operators and multiplies by the sign of the normal orde...

For a field specification 𝓕, and two lists φs = φ₀…φₙ and φs' of 𝓕.CrAnFieldOp the following super commutation relation holds: [φs', φ₀…φₙ]ₛF = ∑ i, 𝓢(φs', φ₀…φᵢ₋₁) • φ₀…φᵢ₋₁ * [φs', φᵢ]ₛF * φᵢ₊₁ … φₙ The proof of this relation is via induction on the length of φs. -/ lemma superCommuteF_ofCrAnListF_ofCrAnListF_eq_sum (φs : List 𝓕.CrAnFiel...

For a field specification 𝓕, the super commutator superCommuteF is defined as the linear map 𝓕.FieldOpFreeAlgebra →ₗ[ℂ] 𝓕.FieldOpFreeAlgebra →ₗ[ℂ] 𝓕.FieldOpFreeAlgebra which on the lists φs and φs' of 𝓕.CrAnFieldOp gives superCommuteF φs φs' = φs * φs' - 𝓢(φs, φs') • φs' * φs. The notation [a, b]ₛF can be used for superCommuteF a b...