Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

R7/R8 side-chain rank multiset (Jain witness 2)

Definition
IntMul_Kappa_R8_Data_BitOppbankSideRanks

by Ethan Cheung Wang · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

bitnbintmulkapparound8schedule

Side-chain rank multiset

From Jain certificate_round7.build on witness 2: the multiset of charged hhh-space chain-step ranks used when rebuilding bit histograms (plain and opp-bank). Twenty rank bins; total multiplicity 162155162155162155. Schedule metadata for the BitNB transplant.

Definition code
import Mathlib.Data.Nat.Basic

set_option autoImplicit false
set_option relaxedAutoImplicit false

/-!
# Side-chain rank multiset of Jain round-7 witness 2

`rk` from `certificate_round7.build`: counts of charged h-space chain steps by rank.
Used by both plain and opp-bank histogram rebuilds. Schedule metadata for BitNB transplant.
-/

namespace IntMul.Kappa.R8.Bit.Oppbank

def sideChainRankHist : List (ℕ × ℕ) :=
  [(1, 50763), (2, 71662), (3, 9939), (4, 13176), (5, 6400), (6, 1869), (7, 703), (8, 1127), (9, 585), (10, 219), (11, 235), (12, 243), (13, 188), (14, 141), (15, 668), (16, 1009), (17, 473), (18, 36), (19, 2219), (21, 500)]

def sideChainRankHist_count : ℕ := (sideChainRankHist.map (·.2)).sum

theorem sideChainRankHist_count_eq :
    sideChainRankHist_count = 162155 := by decide

end IntMul.Kappa.R8.Bit.Oppbank
Source
Jain integer-mult-kappa certificate_round7.build (rk) on certificates/round7 witness 2.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me