Block #622,720

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/8/2014, 3:39:32 AM · Difficulty 10.9547 · 6,186,329 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
14764d4f00dcc9a6c209315694eb7accbab63a9a1e9e17944bb7e7635ed86218

Height

#622,720

Difficulty

10.954670

Transactions

9

Size

3.85 KB

Version

2

Bits

0af4653a

Nonce

1,006,841,613

Timestamp

7/8/2014, 3:39:32 AM

Confirmations

6,186,329

Merkle Root

5299c674ba048a985f4733602fde243304c3bb4fdcbdfd973d8bf16e6583ed77
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.

6.139 × 10⁹⁷(98-digit number)
61391906668178283814…07622269588185354241
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
6.139 × 10⁹⁷(98-digit number)
61391906668178283814…07622269588185354241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.227 × 10⁹⁸(99-digit number)
12278381333635656762…15244539176370708481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.455 × 10⁹⁸(99-digit number)
24556762667271313525…30489078352741416961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.911 × 10⁹⁸(99-digit number)
49113525334542627051…60978156705482833921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.822 × 10⁹⁸(99-digit number)
98227050669085254102…21956313410965667841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.964 × 10⁹⁹(100-digit number)
19645410133817050820…43912626821931335681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.929 × 10⁹⁹(100-digit number)
39290820267634101641…87825253643862671361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.858 × 10⁹⁹(100-digit number)
78581640535268203282…75650507287725342721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.571 × 10¹⁰⁰(101-digit number)
15716328107053640656…51301014575450685441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.143 × 10¹⁰⁰(101-digit number)
31432656214107281312…02602029150901370881
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,716,456 XPM·at block #6,809,048 · 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