Block #421,595

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/27/2014, 4:19:02 AM · Difficulty 10.3732 · 6,387,984 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9bef3ebcbffc4b087dc73ab50b68de9a93ed0bcd403eab63e2e6fbf45a1a56ec

Height

#421,595

Difficulty

10.373184

Transactions

5

Size

1.01 KB

Version

2

Bits

0a5f88f6

Nonce

44,997

Timestamp

2/27/2014, 4:19:02 AM

Confirmations

6,387,984

Merkle Root

13db518ab15430215d4f9e14ddb779b556f1d54b49b463707d74a08765a3c20d
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.

8.496 × 10⁹⁶(97-digit number)
84960564410644351536…47638139001886100901
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
8.496 × 10⁹⁶(97-digit number)
84960564410644351536…47638139001886100901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.699 × 10⁹⁷(98-digit number)
16992112882128870307…95276278003772201801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.398 × 10⁹⁷(98-digit number)
33984225764257740614…90552556007544403601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.796 × 10⁹⁷(98-digit number)
67968451528515481228…81105112015088807201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.359 × 10⁹⁸(99-digit number)
13593690305703096245…62210224030177614401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.718 × 10⁹⁸(99-digit number)
27187380611406192491…24420448060355228801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.437 × 10⁹⁸(99-digit number)
54374761222812384983…48840896120710457601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.087 × 10⁹⁹(100-digit number)
10874952244562476996…97681792241420915201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.174 × 10⁹⁹(100-digit number)
21749904489124953993…95363584482841830401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.349 × 10⁹⁹(100-digit number)
43499808978249907986…90727168965683660801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.699 × 10⁹⁹(100-digit number)
86999617956499815973…81454337931367321601
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,720,709 XPM·at block #6,809,578 · 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