Block #506,307

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/23/2014, 12:22:43 AM · Difficulty 10.8133 · 6,308,830 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2905b88687273853bc93481dcc16435912823a9f7cb825dd7e6b34f5e82c749b

Height

#506,307

Difficulty

10.813336

Transactions

7

Size

1.94 KB

Version

2

Bits

0ad036c5

Nonce

8,588

Timestamp

4/23/2014, 12:22:43 AM

Confirmations

6,308,830

Merkle Root

6f10ecfb96a9d5590ffc7e52ac4259c5b948e1a9713942378c7546ca984b0ade
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.781 × 10⁹⁸(99-digit number)
27815597479596386799…55535800014781300641
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.781 × 10⁹⁸(99-digit number)
27815597479596386799…55535800014781300641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.563 × 10⁹⁸(99-digit number)
55631194959192773598…11071600029562601281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.112 × 10⁹⁹(100-digit number)
11126238991838554719…22143200059125202561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.225 × 10⁹⁹(100-digit number)
22252477983677109439…44286400118250405121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.450 × 10⁹⁹(100-digit number)
44504955967354218878…88572800236500810241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.900 × 10⁹⁹(100-digit number)
89009911934708437757…77145600473001620481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.780 × 10¹⁰⁰(101-digit number)
17801982386941687551…54291200946003240961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.560 × 10¹⁰⁰(101-digit number)
35603964773883375102…08582401892006481921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.120 × 10¹⁰⁰(101-digit number)
71207929547766750205…17164803784012963841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.424 × 10¹⁰¹(102-digit number)
14241585909553350041…34329607568025927681
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,765,189 XPM·at block #6,815,136 · 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