Block #2,272,059

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/28/2017, 3:59:33 PM · Difficulty 10.9540 · 4,558,537 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3d464719a20087a2acff78559c233cba02b20ceeb0b4c92a33d9e7c250e15944

Height

#2,272,059

Difficulty

10.953978

Transactions

61

Size

17.61 KB

Version

2

Bits

0af437e0

Nonce

497,048,329

Timestamp

8/28/2017, 3:59:33 PM

Confirmations

4,558,537

Merkle Root

6afd3b835f200212a63ba00bb4fd8721fe5258445c3e0af544d1bcb0bd230040
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.

7.287 × 10⁹⁵(96-digit number)
72876743442815662483…71042610164905088001
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
7.287 × 10⁹⁵(96-digit number)
72876743442815662483…71042610164905088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.457 × 10⁹⁶(97-digit number)
14575348688563132496…42085220329810176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.915 × 10⁹⁶(97-digit number)
29150697377126264993…84170440659620352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.830 × 10⁹⁶(97-digit number)
58301394754252529987…68340881319240704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.166 × 10⁹⁷(98-digit number)
11660278950850505997…36681762638481408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.332 × 10⁹⁷(98-digit number)
23320557901701011994…73363525276962816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.664 × 10⁹⁷(98-digit number)
46641115803402023989…46727050553925632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.328 × 10⁹⁷(98-digit number)
93282231606804047979…93454101107851264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.865 × 10⁹⁸(99-digit number)
18656446321360809595…86908202215702528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.731 × 10⁹⁸(99-digit number)
37312892642721619191…73816404431405056001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,888,889 XPM·at block #6,830,595 · 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