Block #606,499

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/29/2014, 8:33:55 AM · Difficulty 10.9074 · 6,219,801 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c647c8de3128651d94258587bf5a1b88c6c4251a5a39391ef69c470a9bcba12c

Height

#606,499

Difficulty

10.907426

Transactions

7

Size

1.82 KB

Version

2

Bits

0ae84d19

Nonce

299,888,858

Timestamp

6/29/2014, 8:33:55 AM

Confirmations

6,219,801

Merkle Root

d9abe78b8e923b91a164b44b91cd475c75f17e239b04c05dc80d817798b8efc7
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.164 × 10¹⁰⁰(101-digit number)
11646294939139785656…57559926150558689281
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.164 × 10¹⁰⁰(101-digit number)
11646294939139785656…57559926150558689281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.329 × 10¹⁰⁰(101-digit number)
23292589878279571312…15119852301117378561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.658 × 10¹⁰⁰(101-digit number)
46585179756559142624…30239704602234757121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.317 × 10¹⁰⁰(101-digit number)
93170359513118285249…60479409204469514241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.863 × 10¹⁰¹(102-digit number)
18634071902623657049…20958818408939028481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.726 × 10¹⁰¹(102-digit number)
37268143805247314099…41917636817878056961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.453 × 10¹⁰¹(102-digit number)
74536287610494628199…83835273635756113921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.490 × 10¹⁰²(103-digit number)
14907257522098925639…67670547271512227841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.981 × 10¹⁰²(103-digit number)
29814515044197851279…35341094543024455681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.962 × 10¹⁰²(103-digit number)
59629030088395702559…70682189086048911361
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,854,539 XPM·at block #6,826,299 · 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