Block #2,272,130

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/28/2017, 5:02:28 PM · Difficulty 10.9541 · 4,560,512 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7e59238168ac94b40d2276822d89bab398728e8d9acbef0a83757d331db129a6

Height

#2,272,130

Difficulty

10.954061

Transactions

27

Size

6.24 KB

Version

2

Bits

0af43d57

Nonce

546,410,562

Timestamp

8/28/2017, 5:02:28 PM

Confirmations

4,560,512

Merkle Root

4b7cdbc958aeb04477734d0c58239cda84f966dc1eb030ae28622ca622eadddf
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.

2.717 × 10⁹⁴(95-digit number)
27171121536566147295…99474320679159360201
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
2.717 × 10⁹⁴(95-digit number)
27171121536566147295…99474320679159360201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.434 × 10⁹⁴(95-digit number)
54342243073132294590…98948641358318720401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.086 × 10⁹⁵(96-digit number)
10868448614626458918…97897282716637440801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.173 × 10⁹⁵(96-digit number)
21736897229252917836…95794565433274881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.347 × 10⁹⁵(96-digit number)
43473794458505835672…91589130866549763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.694 × 10⁹⁵(96-digit number)
86947588917011671345…83178261733099526401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.738 × 10⁹⁶(97-digit number)
17389517783402334269…66356523466199052801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.477 × 10⁹⁶(97-digit number)
34779035566804668538…32713046932398105601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.955 × 10⁹⁶(97-digit number)
69558071133609337076…65426093864796211201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.391 × 10⁹⁷(98-digit number)
13911614226721867415…30852187729592422401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.782 × 10⁹⁷(98-digit number)
27823228453443734830…61704375459184844801
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,905,286 XPM·at block #6,832,641 · 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