OAI/Combinatorics/EditApproximation/Numerics/OptimizerWorkspace.lean
7 declarations, 0 contain sorry, 0 declared as axioms
Bit storage of the concrete materialized iterates. The history bound allows every previous iterate to remain live; it does not rely on a garbage collector reclaiming old vector allocations.
- def
OAI.EditApproximation.rationalVectorStorageBitsline 13 - def
OAI.EditApproximation.optimizerStoredHistoryline 16 - def
OAI.EditApproximation.rationalVectorListStorageBitsline 20 - theorem
OAI.EditApproximation.rationalVectorStorageBits_leline 23 - theorem
OAI.EditApproximation.rationalVectorListStorageBits_leline 30 - theorem
OAI.EditApproximation.materializedOptimizerWithWork_uniform_encodingline 42 - theorem
OAI.EditApproximation.optimizerStoredHistory_storage_leline 72