Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An exact packed encoding of the reversed singular-weight lookup table

Proved
OddGoldbach19.packed_weight_factor8000

by Yuxuan Xu · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theoryverified-computation

Let B=264B=2^{64}B=264, D=40907D=40907D=40907, and let W^\widehat WW be the fixed half-difference lookup table. The shared packed integer satisfies

W∗=∑d=1DW^(d)BD−d.W_*=\sum_{d=1}^{D}\widehat W(d)B^{D-d}.W∗​=d=1∑D​W(d)BD−d.

This identity connects the stored integer to the exact finite singular-weight data used by the convolution certificate.

Preamble
import Mathlib
import Definitions.Def_OddGoldbach19_CertificateData8000
import Definitions.Def_OddGoldbach19_PackedData8000
open scoped BigOperators
Formal statement
theorem OddGoldbach19.packed_weight_factor8000 :
    (∑ d∈Finset.Icc 1 40907,OddGoldbach19.Cert8000.WP d*(2^64)^(40907-d))=
      OddGoldbach19.Packed8000.packedW := by sorry
Source
Exact finite packed-integer certificate for the known Riesel-Vaughan finite-shift method; all original-data identifications are independently kernel checked.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me