Block #502,967

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 6:47:23 PM · Difficulty 10.8083 · 6,309,459 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
27646d3dc401233f301ed4494c2448127ed471ec37ecc46a7fe984d84646cea5

Height

#502,967

Difficulty

10.808337

Transactions

4

Size

1.48 KB

Version

2

Bits

0aceef32

Nonce

4,487

Timestamp

4/20/2014, 6:47:23 PM

Confirmations

6,309,459

Merkle Root

1eecb411bb623681502fe8c1b82b83bd7b110c71fc33cd9cc4dd611b5af2b18a
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.052 × 10⁹⁶(97-digit number)
20526353454124186659…75785777886655878401
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.052 × 10⁹⁶(97-digit number)
20526353454124186659…75785777886655878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.105 × 10⁹⁶(97-digit number)
41052706908248373319…51571555773311756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.210 × 10⁹⁶(97-digit number)
82105413816496746639…03143111546623513601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.642 × 10⁹⁷(98-digit number)
16421082763299349327…06286223093247027201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.284 × 10⁹⁷(98-digit number)
32842165526598698655…12572446186494054401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.568 × 10⁹⁷(98-digit number)
65684331053197397311…25144892372988108801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.313 × 10⁹⁸(99-digit number)
13136866210639479462…50289784745976217601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.627 × 10⁹⁸(99-digit number)
26273732421278958924…00579569491952435201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.254 × 10⁹⁸(99-digit number)
52547464842557917849…01159138983904870401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.050 × 10⁹⁹(100-digit number)
10509492968511583569…02318277967809740801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.101 × 10⁹⁹(100-digit number)
21018985937023167139…04636555935619481601
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,743,430 XPM·at block #6,812,425 · 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