Block #517,604

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2014, 1:38:21 AM · Difficulty 10.8516 · 6,307,741 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
081d4a58922bb350e73bb5f0617cd8cad931361b097796fb2a574585cd72c6a7

Height

#517,604

Difficulty

10.851633

Transactions

4

Size

1.15 KB

Version

2

Bits

0ada049c

Nonce

60,992,599

Timestamp

4/30/2014, 1:38:21 AM

Confirmations

6,307,741

Merkle Root

93a424e3df7b54dfd5c0d4562d0b28eb1c54e68ee1523976b1a4aa0f4a796b7c
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.194 × 10⁹⁹(100-digit number)
21944472671218588649…25634333686457656321
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.194 × 10⁹⁹(100-digit number)
21944472671218588649…25634333686457656321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.388 × 10⁹⁹(100-digit number)
43888945342437177299…51268667372915312641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.777 × 10⁹⁹(100-digit number)
87777890684874354599…02537334745830625281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.755 × 10¹⁰⁰(101-digit number)
17555578136974870919…05074669491661250561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.511 × 10¹⁰⁰(101-digit number)
35111156273949741839…10149338983322501121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.022 × 10¹⁰⁰(101-digit number)
70222312547899483679…20298677966645002241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.404 × 10¹⁰¹(102-digit number)
14044462509579896735…40597355933290004481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.808 × 10¹⁰¹(102-digit number)
28088925019159793471…81194711866580008961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.617 × 10¹⁰¹(102-digit number)
56177850038319586943…62389423733160017921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.123 × 10¹⁰²(103-digit number)
11235570007663917388…24778847466320035841
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,846,865 XPM·at block #6,825,344 · 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