Block #501,725

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/19/2014, 11:31:37 PM · Difficulty 10.8045 · 6,322,916 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ecae002ebd5fbd96acd18daac929025a30572415736bdce00e1ec6ef6b164a9f

Height

#501,725

Difficulty

10.804484

Transactions

2

Size

566 B

Version

2

Bits

0acdf2ab

Nonce

51,721

Timestamp

4/19/2014, 11:31:37 PM

Confirmations

6,322,916

Merkle Root

839af33c1a86b17897b6515d60c0c25171a5c9ba39a15552fdd1ff133584167e
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.

3.875 × 10⁹⁶(97-digit number)
38758644146069401062…03897243600862317061
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
3.875 × 10⁹⁶(97-digit number)
38758644146069401062…03897243600862317061
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.751 × 10⁹⁶(97-digit number)
77517288292138802125…07794487201724634121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.550 × 10⁹⁷(98-digit number)
15503457658427760425…15588974403449268241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.100 × 10⁹⁷(98-digit number)
31006915316855520850…31177948806898536481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.201 × 10⁹⁷(98-digit number)
62013830633711041700…62355897613797072961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.240 × 10⁹⁸(99-digit number)
12402766126742208340…24711795227594145921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.480 × 10⁹⁸(99-digit number)
24805532253484416680…49423590455188291841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.961 × 10⁹⁸(99-digit number)
49611064506968833360…98847180910376583681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.922 × 10⁹⁸(99-digit number)
99222129013937666720…97694361820753167361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.984 × 10⁹⁹(100-digit number)
19844425802787533344…95388723641506334721
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,841,192 XPM·at block #6,824,640 · 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