Definitions of ExactPadding: Exact-size padded succinct descriptions The common input width is a power of two, and the number of input and gate…
DefinitionMIPRE_TM_CookLevin_ExactPaddingThe definitions of the module MIPRE.TM.CookLevin.ExactPadding of the MIP* = RE formalization (commit 70cbf1c of vidick/MIPRE-formalization). Exact-size padded succinct descriptions. The common input width is a power of two, and the number of input and gate variables is a second power of two. Circuit construction consumes a unary gate budget: the target size can be polynomial in the value of Q and σ, so printing it is not polynomial in their binary encodings alone. The PCP view will supply this budget. Parameter computation is a separate obligation.
Definitions (3): MIPRE.TM.CookLevin.Pad.describeExact (Add gates up to the supplied budget.); MIPRE.TM.CookLevin.Pad.gateCount (The exact number of gates.); MIPRE.TM.CookLevin.Pad.outerDim (The outer power-of-two variable count, including enough spare gates.).
Formalization Note The bundle is the module MIPRE.TM.CookLevin.ExactPadding (MIPRE/TM/CookLevin/ExactPadding.lean) with every declaration not listed removed, imports rewritten to the bundles of the module's import closure; the declarations keep their names, statements and bodies; the source module is split over 78 imported bundle(s).
/- Copyright (c) 2026 MIPRE contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. -/ /- Generated for Prove2Me from vidick/MIPRE-formalization@70cbf1c, MIPRE/TM/CookLevin/ExactPadding.lean (definition bundle: declarations the uploaded statements rest on); produced mechanically by prove2me/tools/gen.py, never edited by hand. -/ import Mathlib.Algebra.BigOperators.Group.Finset.Basic import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Algebra.Order.BigOperators.Group.Finset import Mathlib.Algebra.Order.Group.Abs import Mathlib.Algebra.Order.Group.Int import Mathlib.Algebra.Polynomial.Eval.Defs import Mathlib.Algebra.Polynomial.Eval.Degree import Mathlib.Analysis.CStarAlgebra.CStarMatrix import Mathlib.Analysis.CStarAlgebra.Classes import Mathlib.Analysis.Matrix.Order import Mathlib.Computability.Language import Mathlib.Computability.Primrec.List import Mathlib.Data.ENat.Lattice import Mathlib.Data.Finset.Max import Mathlib.Data.Fintype.Basic import Mathlib.Data.Fintype.BigOperators import Mathlib.Data.Fintype.Option import Mathlib.Data.Fintype.Pi import Mathlib.Data.Fintype.Prod import Mathlib.Data.Fintype.Sigma import Mathlib.Data.Fintype.Sum import Mathlib.Data.Int.Interval import Mathlib.Data.List.Basic import Mathlib.Data.Nat.Bits import Mathlib.Data.Nat.Bitwise import Mathlib.Data.Nat.Notation import Mathlib.Data.Nat.Size import Mathlib.Data.Real.Basic import Mathlib.Data.Set.Basic import Mathlib.Data.Sign.Defs import Mathlib.Data.ZMod.Basic import Mathlib.LinearAlgebra.Matrix.Kronecker import Mathlib.LinearAlgebra.Pi import Mathlib.Logic.Denumerable import Mathlib.Logic.Function.Iterate import Mathlib.Logic.Relation import Mathlib.Tactic import Mathlib.Tactic.DeriveFintype import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring import Definitions.Def_MIPRE_Foundations_Games import Definitions.Def_MIPRE_Foundations_CL_Register import Definitions.Def_MIPRE_Foundations_CL_Basic import Definitions.Def_MIPRE_Foundations_Cost_Basic_B import Definitions.Def_MIPRE_Foundations_Cost_Encoding_B import Definitions.Def_MIPRE_Foundations_SAT_Circuit import Definitions.Def_MIPRE_Foundations_SAT_Cnf import Definitions.Def_MIPRE_Foundations_Cost_PolyTime import Definitions.Def_MIPRE_Foundations_CL_Closure import Definitions.Def_MIPRE_Foundations_CL_Closure_B import Definitions.Def_MIPRE_Foundations_CL_Sampler import Definitions.Def_MIPRE_Foundations_Verifier import Definitions.Def_MIPRE_Foundations_SAT_Succinct import Definitions.Def_MIPRE_Foundations_SAT_Decoupled import Definitions.Def_MIPRE_Foundations_Cost_Closure import Definitions.Def_MIPRE_Foundations_Cost_Loops_B import Definitions.Def_MIPRE_Foundations_Cost_Fold import Definitions.Def_MIPRE_Foundations_Cost_Unary import Definitions.Def_MIPRE_Foundations_Cost_Numeric_B import Definitions.Def_MIPRE_Foundations_Cost_Codable_B import Definitions.Def_MIPRE_Foundations_Cost_Binary import Definitions.Def_MIPRE_Foundations_SAT_Formula import Definitions.Def_MIPRE_Foundations_SAT_FmlLib import Definitions.Def_MIPRE_Foundations_SAT_Flatten import Definitions.Def_MIPRE_Foundations_Cost_Reader import Definitions.Def_MIPRE_Foundations_SAT_FmlProg import Definitions.Def_MIPRE_Foundations_SAT_ArrayProg import Definitions.Def_MIPRE_Foundations_Cost_TreeBits import Definitions.Def_MIPRE_Foundations_Cost_Machine_B import Definitions.Def_MIPRE_Foundations_Cost_MachineData_B import Definitions.Def_MIPRE_Foundations_Cost_MachineBound_B import Definitions.Def_MIPRE_Foundations_Cost_Growth import Definitions.Def_MIPRE_Cslib_Foundations_Data_RelatesInSteps import Definitions.Def_MIPRE_Cslib_Computability_Machines_Turing_MultiTape_Deterministic import Definitions.Def_MIPRE_TM_MultiInput_Deterministic import Definitions.Def_MIPRE_TM_CookLevin_Local import Definitions.Def_MIPRE_Foundations_SAT_Tseitin import Definitions.Def_MIPRE_TM_CookLevin_Tableau import Definitions.Def_MIPRE_TM_Interp_Instr import Definitions.Def_MIPRE_TM_Interp_Machine import Definitions.Def_MIPRE_TM_CookLevin_Layout import Definitions.Def_MIPRE_TM_CookLevin_FieldFml import Definitions.Def_MIPRE_TM_CookLevin_Kinds import Definitions.Def_MIPRE_TM_CookLevin_Families import Definitions.Def_MIPRE_TM_CookLevin_Window import Definitions.Def_MIPRE_TM_CookLevin_FamilyFml import Definitions.Def_MIPRE_TM_Interp_Tape import Definitions.Def_MIPRE_TM_Interp_Reach import Definitions.Def_MIPRE_TM_Interp_Routines import Definitions.Def_MIPRE_TM_Interp_Repr import Definitions.Def_MIPRE_TM_Interp_CopyTree import Definitions.Def_MIPRE_TM_Interp_GetEnv import Definitions.Def_MIPRE_TM_Interp_Desc import Definitions.Def_MIPRE_TM_Interp_Step import Definitions.Def_MIPRE_TM_Interp_InputRoutines import Definitions.Def_MIPRE_TM_Interp_Run import Definitions.Def_MIPRE_Foundations_SAT_Table import Definitions.Def_MIPRE_TM_CookLevin_Params import Definitions.Def_MIPRE_TM_CookLevin_AnsEnd import Definitions.Def_MIPRE_TM_CookLevin_Index import Definitions.Def_MIPRE_TM_CookLevin_Describer import Definitions.Def_MIPRE_TM_CookLevin_LayoutProg import Definitions.Def_MIPRE_TM_CookLevin_FieldProg import Definitions.Def_MIPRE_TM_CookLevin_FamilyProg import Definitions.Def_MIPRE_TM_CookLevin_DescProg import Definitions.Def_MIPRE_TM_CookLevin_Semantics import Definitions.Def_MIPRE_TM_CookLevin_Correct import Definitions.Def_MIPRE_TM_CookLevin_Sound import Definitions.Def_MIPRE_TM_CookLevin_Sat import Definitions.Def_MIPRE_TM_CookLevin_Assemble import Definitions.Def_MIPRE_TM_CookLevin_Link import Definitions.Def_MIPRE_TM_CookLevin_Decoupled import Definitions.Def_MIPRE_TM_CookLevin_DecoupledProg import Definitions.Def_MIPRE_Foundations_SAT_Padding import Definitions.Def_MIPRE_Foundations_SAT_Rename import Definitions.Def_MIPRE_Foundations_SAT_PowerPadding import Definitions.Def_MIPRE_TM_CookLevin_Padded import Definitions.Def_MIPRE_Foundations_SAT_GatePadding /-! # Exact-size padded succinct descriptions The common input width is a power of two, and the number of input and gate variables is a second power of two. Circuit construction consumes a unary gate budget: the target size can be polynomial in the *value* of `Q` and `σ`, so printing it is not polynomial in their binary encodings alone. The PCP view will supply this budget. Parameter computation is a separate obligation. -/ namespace MIPRE.TM.CookLevin.Pad open SAT Cost Cost.PolyTimeFun Desc /-- The outer power-of-two variable count, including enough spare gates. -/ noncomputable def outerDim (n T Q σ : ℕ) : ℕ := ceilPower (6 * innerDim T σ + 5 + roundUp gatePoly n T Q σ) /-- The exact number of gates. -/ noncomputable def gateCount (n T Q σ : ℕ) : ℕ := outerDim n T Q σ - (5 * innerDim T σ + 5) /-- Add gates up to the supplied budget. A too-small budget leaves the circuit unchanged; it never triggers an unbounded unary expansion. -/ noncomputable def describeExact : PolyTimeFun (DescInput × Unary) Circuit := let C := describe.comp fst let gs := snd.comp (Circuit.partsProg.comp C) ap₂ Circuit.padGatesProg C (ap₂ drop snd (length.comp gs)) end MIPRE.TM.CookLevin.Pad