Block #2,272,050

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/28/2017, 3:42:36 PM · Difficulty 10.9541 · 4,558,399 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
461d9be3f38a1092ac1d552aedf302825e75f1654748374d0c174e7ef78a2caa

Height

#2,272,050

Difficulty

10.954070

Transactions

2

Size

723 B

Version

2

Bits

0af43de9

Nonce

662,436,148

Timestamp

8/28/2017, 3:42:36 PM

Confirmations

4,558,399

Merkle Root

68b70dc6f7a4dd1155eed80bc270e6f99a7a18b8c949b9e6a55685d143cc86fd
Transactions (2)
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.

4.689 × 10⁹⁶(97-digit number)
46895933297063664274…10425081139296578561
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
4.689 × 10⁹⁶(97-digit number)
46895933297063664274…10425081139296578561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.379 × 10⁹⁶(97-digit number)
93791866594127328548…20850162278593157121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.875 × 10⁹⁷(98-digit number)
18758373318825465709…41700324557186314241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.751 × 10⁹⁷(98-digit number)
37516746637650931419…83400649114372628481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.503 × 10⁹⁷(98-digit number)
75033493275301862838…66801298228745256961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.500 × 10⁹⁸(99-digit number)
15006698655060372567…33602596457490513921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.001 × 10⁹⁸(99-digit number)
30013397310120745135…67205192914981027841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.002 × 10⁹⁸(99-digit number)
60026794620241490271…34410385829962055681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.200 × 10⁹⁹(100-digit number)
12005358924048298054…68820771659924111361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.401 × 10⁹⁹(100-digit number)
24010717848096596108…37641543319848222721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.802 × 10⁹⁹(100-digit number)
48021435696193192216…75283086639696445441
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,887,836 XPM·at block #6,830,448 · 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