Block #1,603,874

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/28/2016, 4:00:17 PM · Difficulty 10.5984 · 5,229,898 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1e3b937bc7207dd382c0d85f5dfbfc63a2d9b2e79bac8a9a6a5308436ea360df

Height

#1,603,874

Difficulty

10.598446

Transactions

3

Size

2.63 KB

Version

2

Bits

0a9933c1

Nonce

1,741,692,577

Timestamp

5/28/2016, 4:00:17 PM

Confirmations

5,229,898

Merkle Root

974a71f545524f3cbac57f7fe640a26d1ca5f0817c32a98ccf51593a89e55262
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.

1.713 × 10⁹⁵(96-digit number)
17132326825434072608…89692328386365652641
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
1.713 × 10⁹⁵(96-digit number)
17132326825434072608…89692328386365652641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.426 × 10⁹⁵(96-digit number)
34264653650868145216…79384656772731305281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.852 × 10⁹⁵(96-digit number)
68529307301736290432…58769313545462610561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.370 × 10⁹⁶(97-digit number)
13705861460347258086…17538627090925221121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.741 × 10⁹⁶(97-digit number)
27411722920694516172…35077254181850442241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.482 × 10⁹⁶(97-digit number)
54823445841389032345…70154508363700884481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.096 × 10⁹⁷(98-digit number)
10964689168277806469…40309016727401768961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.192 × 10⁹⁷(98-digit number)
21929378336555612938…80618033454803537921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.385 × 10⁹⁷(98-digit number)
43858756673111225876…61236066909607075841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.771 × 10⁹⁷(98-digit number)
87717513346222451753…22472133819214151681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.754 × 10⁹⁸(99-digit number)
17543502669244490350…44944267638428303361
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,914,393 XPM·at block #6,833,771 · 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