Block #602,619

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/26/2014, 10:22:43 AM · Difficulty 10.9132 · 6,205,854 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
443a8a6f9a9e84ceb301a6061b1a433b36c55457b86bac31bdd69b0bf572dd54

Height

#602,619

Difficulty

10.913170

Transactions

8

Size

2.32 KB

Version

2

Bits

0ae9c57a

Nonce

685,244,799

Timestamp

6/26/2014, 10:22:43 AM

Confirmations

6,205,854

Merkle Root

b7571e59e0533b4bc15643044029b45bc6d4dacead7be5e2f5e9a93ad1f5a8b7
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.348 × 10⁹⁸(99-digit number)
13483405839310334631…35352348440076582401
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.348 × 10⁹⁸(99-digit number)
13483405839310334631…35352348440076582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.696 × 10⁹⁸(99-digit number)
26966811678620669262…70704696880153164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.393 × 10⁹⁸(99-digit number)
53933623357241338525…41409393760306329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.078 × 10⁹⁹(100-digit number)
10786724671448267705…82818787520612659201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.157 × 10⁹⁹(100-digit number)
21573449342896535410…65637575041225318401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.314 × 10⁹⁹(100-digit number)
43146898685793070820…31275150082450636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.629 × 10⁹⁹(100-digit number)
86293797371586141640…62550300164901273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.725 × 10¹⁰⁰(101-digit number)
17258759474317228328…25100600329802547201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.451 × 10¹⁰⁰(101-digit number)
34517518948634456656…50201200659605094401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.903 × 10¹⁰⁰(101-digit number)
69035037897268913312…00402401319210188801
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,711,840 XPM·at block #6,808,472 · 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