Block #284,421

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/30/2013, 3:06:31 AM · Difficulty 9.9827 · 6,540,175 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
52443c48a553e968ddad09dd8e290b772b32fb342de45653ab0707d86e31c870

Height

#284,421

Difficulty

9.982680

Transactions

1

Size

1.18 KB

Version

2

Bits

09fb90f2

Nonce

15,430

Timestamp

11/30/2013, 3:06:31 AM

Confirmations

6,540,175

Merkle Root

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

1.653 × 10⁹³(94-digit number)
16536904828635868419…17553948550517434141
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
1.653 × 10⁹³(94-digit number)
16536904828635868419…17553948550517434141
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.307 × 10⁹³(94-digit number)
33073809657271736839…35107897101034868281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.614 × 10⁹³(94-digit number)
66147619314543473679…70215794202069736561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.322 × 10⁹⁴(95-digit number)
13229523862908694735…40431588404139473121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.645 × 10⁹⁴(95-digit number)
26459047725817389471…80863176808278946241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.291 × 10⁹⁴(95-digit number)
52918095451634778943…61726353616557892481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.058 × 10⁹⁵(96-digit number)
10583619090326955788…23452707233115784961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.116 × 10⁹⁵(96-digit number)
21167238180653911577…46905414466231569921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.233 × 10⁹⁵(96-digit number)
42334476361307823154…93810828932463139841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.466 × 10⁹⁵(96-digit number)
84668952722615646309…87621657864926279681
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,840,837 XPM·at block #6,824,595 · 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