Block #501,055

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/19/2014, 1:28:42 PM · Difficulty 10.8019 · 6,308,170 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
afdec6d71315b245e679dd88b7aba0e01895a59064dc5a8c752ed58b040f904f

Height

#501,055

Difficulty

10.801938

Transactions

1

Size

834 B

Version

2

Bits

0acd4bcd

Nonce

164,838

Timestamp

4/19/2014, 1:28:42 PM

Confirmations

6,308,170

Merkle Root

aa34db8f64d111cd0d7b9bf227746567aa59e81921a85c3212514a46f2bed1cf
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.

4.919 × 10⁹⁶(97-digit number)
49194278628659733727…71319784309787357281
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
4.919 × 10⁹⁶(97-digit number)
49194278628659733727…71319784309787357281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.838 × 10⁹⁶(97-digit number)
98388557257319467455…42639568619574714561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.967 × 10⁹⁷(98-digit number)
19677711451463893491…85279137239149429121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.935 × 10⁹⁷(98-digit number)
39355422902927786982…70558274478298858241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.871 × 10⁹⁷(98-digit number)
78710845805855573964…41116548956597716481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.574 × 10⁹⁸(99-digit number)
15742169161171114792…82233097913195432961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.148 × 10⁹⁸(99-digit number)
31484338322342229585…64466195826390865921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.296 × 10⁹⁸(99-digit number)
62968676644684459171…28932391652781731841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.259 × 10⁹⁹(100-digit number)
12593735328936891834…57864783305563463681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.518 × 10⁹⁹(100-digit number)
25187470657873783668…15729566611126927361
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,717,863 XPM·at block #6,809,224 · 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