ProximityPrize.SubmissionUpper.EnumerationProbe.toyRoot
DefinitionYukon_cd03a0807f2db523ebc7e512better-codes-history
Source declaration ProximityPrize.SubmissionUpper.EnumerationProbe.toyRoot.
Original contribution: jacklightChen, verified Better Codes submission 908984bd-7ffa-4003-8ee9-09ed8864e0ae. Source Lean 4.32.2, exact commit 4de021b74b21124943c35eeda5da5c891571ad3e. Statements, definitions and proof bodies preserved; imports and exported names adapted for Prove2Me.
Definition code
/- Copyright (c) 2026 Proximity Prize Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. -/ import Mathlib /-! # A kernel-evaluated small analogue of the 1024-fold key map This file deliberately leaves the scored construction unchanged. It asks the remote verifier to exhaust all eight-subsets of the fifteen nontrivial powers of a primitive sixteenth root in `ZMod 17`, represented by natural residues. The two key coordinates are the first Newton coefficient and the product exponent modulo sixteen. Candidates are traversed once while accumulating a `16 × 17` histogram, so the expensive key calculation is not repeated for every possible key. A preceding remote smoke test established that this histogram evaluates within the verifier budget, and a second run proved the upper bounds 64, 44, 34, and 29, while a remote run proved that the bound 26 is false. This probe asks whether every fibre has size at most 28. -/ namespace ProximityPrize.SubmissionUpper.EnumerationProbe def toyRoot (e : ℕ) : ℕ := 3 ^ (e + 1) % 17 end EnumerationProbe end SubmissionUpper end ProximityPrize
Source