Block #500,666

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/19/2014, 7:09:30 AM · Difficulty 10.8015 · 6,308,994 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
404a5c094d03e32007da3a4c5dcd983d9c6810441d4af68746fc09b78c146f0b

Height

#500,666

Difficulty

10.801515

Transactions

9

Size

2.41 KB

Version

2

Bits

0acd301b

Nonce

45,222,466

Timestamp

4/19/2014, 7:09:30 AM

Confirmations

6,308,994

Merkle Root

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

1.738 × 10⁹⁸(99-digit number)
17385295143677477522…42329944873577675201
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
1.738 × 10⁹⁸(99-digit number)
17385295143677477522…42329944873577675201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.477 × 10⁹⁸(99-digit number)
34770590287354955044…84659889747155350401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.954 × 10⁹⁸(99-digit number)
69541180574709910089…69319779494310700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.390 × 10⁹⁹(100-digit number)
13908236114941982017…38639558988621401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.781 × 10⁹⁹(100-digit number)
27816472229883964035…77279117977242803201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.563 × 10⁹⁹(100-digit number)
55632944459767928071…54558235954485606401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.112 × 10¹⁰⁰(101-digit number)
11126588891953585614…09116471908971212801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.225 × 10¹⁰⁰(101-digit number)
22253177783907171228…18232943817942425601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.450 × 10¹⁰⁰(101-digit number)
44506355567814342457…36465887635884851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.901 × 10¹⁰⁰(101-digit number)
89012711135628684914…72931775271769702401
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,721,353 XPM·at block #6,809,659 · 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