Block #504,317

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/21/2014, 5:05:01 PM · Difficulty 10.8087 · 6,312,532 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
29b002840a304a4013d6830e784bb735a145f1016cf9ec861166f11ec5b44d2c

Height

#504,317

Difficulty

10.808706

Transactions

8

Size

2.80 KB

Version

2

Bits

0acf0756

Nonce

4,632

Timestamp

4/21/2014, 5:05:01 PM

Confirmations

6,312,532

Merkle Root

bb3d1181aa25841a5ac02add6d0e47f8f6ce6c76c58c1cc5216f48920a2b9b2a
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.760 × 10⁹⁵(96-digit number)
37606555575645603076…09647400436444567361
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.760 × 10⁹⁵(96-digit number)
37606555575645603076…09647400436444567361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.521 × 10⁹⁵(96-digit number)
75213111151291206152…19294800872889134721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.504 × 10⁹⁶(97-digit number)
15042622230258241230…38589601745778269441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.008 × 10⁹⁶(97-digit number)
30085244460516482461…77179203491556538881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.017 × 10⁹⁶(97-digit number)
60170488921032964922…54358406983113077761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.203 × 10⁹⁷(98-digit number)
12034097784206592984…08716813966226155521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.406 × 10⁹⁷(98-digit number)
24068195568413185968…17433627932452311041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.813 × 10⁹⁷(98-digit number)
48136391136826371937…34867255864904622081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.627 × 10⁹⁷(98-digit number)
96272782273652743875…69734511729809244161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.925 × 10⁹⁸(99-digit number)
19254556454730548775…39469023459618488321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.850 × 10⁹⁸(99-digit number)
38509112909461097550…78938046919236976641
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,778,834 XPM·at block #6,816,848 · 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