Block #329,590

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/26/2013, 2:02:04 AM · Difficulty 10.1700 · 6,488,343 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ea41ee4b643edf48e63fec78078a9b5a633c519adadbcc169d1e4e7db71028d2

Height

#329,590

Difficulty

10.170034

Transactions

4

Size

881 B

Version

2

Bits

0a2b8759

Nonce

208,185

Timestamp

12/26/2013, 2:02:04 AM

Confirmations

6,488,343

Merkle Root

5be8cc218945865e7ffe318520e3a62ba9daf2dbf92194a551cb2edfc97043b2
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.288 × 10⁹⁹(100-digit number)
22888925179913806903…68114236769888647361
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.288 × 10⁹⁹(100-digit number)
22888925179913806903…68114236769888647361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.577 × 10⁹⁹(100-digit number)
45777850359827613807…36228473539777294721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.155 × 10⁹⁹(100-digit number)
91555700719655227614…72456947079554589441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.831 × 10¹⁰⁰(101-digit number)
18311140143931045522…44913894159109178881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.662 × 10¹⁰⁰(101-digit number)
36622280287862091045…89827788318218357761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.324 × 10¹⁰⁰(101-digit number)
73244560575724182091…79655576636436715521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.464 × 10¹⁰¹(102-digit number)
14648912115144836418…59311153272873431041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.929 × 10¹⁰¹(102-digit number)
29297824230289672836…18622306545746862081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.859 × 10¹⁰¹(102-digit number)
58595648460579345673…37244613091493724161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.171 × 10¹⁰²(103-digit number)
11719129692115869134…74489226182987448321
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,787,529 XPM·at block #6,817,932 · 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