Block #2,583,428

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2018, 6:53:44 PM · Difficulty 11.1734 · 4,254,763 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
f18d854aa377dbb54a62b9c6f374dc49f2286be71102dd60121e19991ae7a726

Height

#2,583,428

Difficulty

11.173423

Transactions

5

Size

1.67 KB

Version

2

Bits

0b2c6575

Nonce

51,978,959

Timestamp

3/24/2018, 6:53:44 PM

Confirmations

4,254,763

Merkle Root

dbb62d0373846bc3d328a55e74296ec9f04b73168e272edac4d6f1ba52b3952a
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

3.395 × 10⁹⁵(96-digit number)
33955242818160340890…78237844755189203841
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
3.395 × 10⁹⁵(96-digit number)
33955242818160340890…78237844755189203841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.791 × 10⁹⁵(96-digit number)
67910485636320681781…56475689510378407681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.358 × 10⁹⁶(97-digit number)
13582097127264136356…12951379020756815361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.716 × 10⁹⁶(97-digit number)
27164194254528272712…25902758041513630721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.432 × 10⁹⁶(97-digit number)
54328388509056545425…51805516083027261441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.086 × 10⁹⁷(98-digit number)
10865677701811309085…03611032166054522881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.173 × 10⁹⁷(98-digit number)
21731355403622618170…07222064332109045761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.346 × 10⁹⁷(98-digit number)
43462710807245236340…14444128664218091521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.692 × 10⁹⁷(98-digit number)
86925421614490472680…28888257328436183041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.738 × 10⁹⁸(99-digit number)
17385084322898094536…57776514656872366081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.477 × 10⁹⁸(99-digit number)
34770168645796189072…15553029313744732161
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★★☆☆
Rarity
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,949,801 XPM·at block #6,838,190 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy