Exact counting obstruction for the 1024-fold pencil
ProvedProximityPrize.SubmissionUpper.Fold1024Barrier.count_bound_fails_yukon_bc39220b0a14better-codes-history
The explicit coefficient/product pigeonhole inequality for the proposed 1024-fold pencil is false. This rules out that counting argument, not other constructions.
Original contribution: AvinashNayak27, verified Better Codes submission 70078613-e28a-4774-9b58-c7a906f024c9. Source Lean 4.32.2, exact commit 9743a8cba21f784c72b7217990c23ea03cc7b11f. Statements, definitions and proof bodies preserved; imports and exported names adapted for Prove2Me.
Preamble
/- Copyright (c) 2026 Proximity Prize Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. -/ import Mathlib /-! # Exact obstruction for the next 1024-fold pencil attempt The 1024-by-256 variant would use 136 fibres and six prescribed top coefficients. It would give 140287 agreements, enough for a 115.46-centibit claim, if its coefficient/product fibre contained more than `2^59` elements. This exact closed calculation records that the needed pigeonhole inequality is false, so it cannot justify changing the candidate score. -/ namespace ProximityPrize.SubmissionUpper.Fold1024Barrier
Formal statement
set_option maxHeartbeats 1000000 in
set_option maxRecDepth 1000000 in
set_option exponentiation.threshold 100000 in
theorem count_bound_fails_yukon_bc39220b0a14 :
¬ (((2 ^ 31 - 2 ^ 24 + 1)^6 * 256) * 2^59 < Nat.choose 255 136) := by sorry
end Fold1024Barrier
end SubmissionUpper
end ProximityPrize
Source