Block #1,605,804

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/29/2016, 11:26:33 PM · Difficulty 10.6020 · 5,202,842 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e2e31c75014aef35e1db0bc56127326943be7a05d84e09d3f97349971b7baf50

Height

#1,605,804

Difficulty

10.601978

Transactions

6

Size

8.72 KB

Version

2

Bits

0a9a1b33

Nonce

77,682,329

Timestamp

5/29/2016, 11:26:33 PM

Confirmations

5,202,842

Merkle Root

85e6e38cb2b133c41bf145060aa3647a72f3d93f0f7afcac064fb7e54655e322
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.390 × 10⁹³(94-digit number)
23903452014436717333…33401115367487082621
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.390 × 10⁹³(94-digit number)
23903452014436717333…33401115367487082621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.780 × 10⁹³(94-digit number)
47806904028873434667…66802230734974165241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.561 × 10⁹³(94-digit number)
95613808057746869335…33604461469948330481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.912 × 10⁹⁴(95-digit number)
19122761611549373867…67208922939896660961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.824 × 10⁹⁴(95-digit number)
38245523223098747734…34417845879793321921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.649 × 10⁹⁴(95-digit number)
76491046446197495468…68835691759586643841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.529 × 10⁹⁵(96-digit number)
15298209289239499093…37671383519173287681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.059 × 10⁹⁵(96-digit number)
30596418578478998187…75342767038346575361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.119 × 10⁹⁵(96-digit number)
61192837156957996374…50685534076693150721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.223 × 10⁹⁶(97-digit number)
12238567431391599274…01371068153386301441
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,713,220 XPM·at block #6,808,645 · 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.

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