While this submission is a draft, it cannot be used by other submissions.

Proof of `The steps between objectives on words` (3rd statement)

groundedproofs/Lax434175Proofs/ThresholdProgram.lean · lax-434175

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The program comcom reads the word into an array and writes the rows with the new due dates and the new threshold, all in one pass: O(∣u∣)O(|u|) operations on numbers of O(log)O(log) bits.