Block #506,346

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/23/2014, 12:57:35 AM · Difficulty 10.8135 · 6,303,186 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
99828be4adea3474a8fc56a4743953f07010cf378f2fa5cf953f4a004690a4a4

Height

#506,346

Difficulty

10.813485

Transactions

2

Size

764 B

Version

2

Bits

0ad04091

Nonce

16,897

Timestamp

4/23/2014, 12:57:35 AM

Confirmations

6,303,186

Merkle Root

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

7.432 × 10⁹⁷(98-digit number)
74321661626274305431…46425838958881168001
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
7.432 × 10⁹⁷(98-digit number)
74321661626274305431…46425838958881168001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.486 × 10⁹⁸(99-digit number)
14864332325254861086…92851677917762336001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.972 × 10⁹⁸(99-digit number)
29728664650509722172…85703355835524672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.945 × 10⁹⁸(99-digit number)
59457329301019444344…71406711671049344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.189 × 10⁹⁹(100-digit number)
11891465860203888868…42813423342098688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.378 × 10⁹⁹(100-digit number)
23782931720407777737…85626846684197376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.756 × 10⁹⁹(100-digit number)
47565863440815555475…71253693368394752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.513 × 10⁹⁹(100-digit number)
95131726881631110951…42507386736789504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.902 × 10¹⁰⁰(101-digit number)
19026345376326222190…85014773473579008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.805 × 10¹⁰⁰(101-digit number)
38052690752652444380…70029546947158016001
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,720,334 XPM·at block #6,809,531 · 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