Block #502,175

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 6:18:49 AM · Difficulty 10.8065 · 6,308,643 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fa21599ffcef4cd5f3126d1175395fb9ff70212858de3bee2b2a1c5e8aeb823b

Height

#502,175

Difficulty

10.806484

Transactions

10

Size

2.90 KB

Version

2

Bits

0ace75bc

Nonce

3,838,711

Timestamp

4/20/2014, 6:18:49 AM

Confirmations

6,308,643

Merkle Root

5f206392eb39c65e2336c7ba3a5fa9a7620e7c46fb7c9456d5c92e320f096fa0
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.182 × 10⁹⁵(96-digit number)
41827755192295819270…34904834907740948081
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.182 × 10⁹⁵(96-digit number)
41827755192295819270…34904834907740948081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.365 × 10⁹⁵(96-digit number)
83655510384591638541…69809669815481896161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.673 × 10⁹⁶(97-digit number)
16731102076918327708…39619339630963792321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.346 × 10⁹⁶(97-digit number)
33462204153836655416…79238679261927584641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.692 × 10⁹⁶(97-digit number)
66924408307673310833…58477358523855169281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.338 × 10⁹⁷(98-digit number)
13384881661534662166…16954717047710338561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.676 × 10⁹⁷(98-digit number)
26769763323069324333…33909434095420677121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.353 × 10⁹⁷(98-digit number)
53539526646138648666…67818868190841354241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.070 × 10⁹⁸(99-digit number)
10707905329227729733…35637736381682708481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.141 × 10⁹⁸(99-digit number)
21415810658455459466…71275472763365416961
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,730,645 XPM·at block #6,810,817 · 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