Total native LP-solver execution on arbitrary word input
OpenLax109476Proofs.RamSolverTotalExecution.solve_specLet be any finite natural-word list, including malformed encodings, and let be its binary size. Assume and the complete initialized frontend and solver workspace. The fixed command has at most instructions and returns its full outcome: invalid input has validity flag zero and unchanged output, while valid decoded input receives a valid encoded certificate. Thus
This is a reusable source interface for composing the complete finite-program implementation.
Retired because the namespace-wrapped declaration compiled during publication but the proof-comparison parser rejects that header (expected token / unknown full theorem identifier). The mathematically identical, fully qualified declaration is Lax109476Proofs.RamSolverTotalExecution.solve_spec_native.
import Definitions.Def_EdgeSublinearMWIS_Main_NativeDetailedInterfaces
namespace Lax109476Proofs.RamSolverTotalExecution
theorem solve_spec : ∀ (xs : List Nat) (w : Nat),
Nat.le (Lax109476Proofs.RamUniformSolverBounds.wordWidth (Lax759944.BinaryWordEncoding.bitSize xs)) w →
Lax808846Proofs.Reasoning.Spec
(@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
((2:Nat)) w)
(Lax109476Proofs.RamSolverTotalExecution.Input
(@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
((2:Nat)) w)
xs)
Lax109476Proofs.RamExactSolverProgram.solve (Lax109476Proofs.RamSolverTotalExecution.Result xs)
(Lax109476Proofs.RamUniformSolverBounds.instructionBound (Lax759944.BinaryWordEncoding.bitSize xs)) := by sorry
end Lax109476Proofs.RamSolverTotalExecution