Block #603,799

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/27/2014, 8:07:07 AM · Difficulty 10.9110 · 6,202,637 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
be0618404e9c6212fc1df6a7130ab783f5f9c2191a1509936a2e3e9fcadd81f2

Height

#603,799

Difficulty

10.911016

Transactions

7

Size

3.12 KB

Version

2

Bits

0ae93853

Nonce

43,785,957

Timestamp

6/27/2014, 8:07:07 AM

Confirmations

6,202,637

Merkle Root

bf5f88bbef2e4e3075feb80b8525bd1941fcdf58193ea7e74cf9efc24b6f2b79
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.934 × 10⁹⁷(98-digit number)
19342798720020654427…91632853800083205321
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.934 × 10⁹⁷(98-digit number)
19342798720020654427…91632853800083205321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.868 × 10⁹⁷(98-digit number)
38685597440041308854…83265707600166410641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.737 × 10⁹⁷(98-digit number)
77371194880082617708…66531415200332821281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.547 × 10⁹⁸(99-digit number)
15474238976016523541…33062830400665642561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.094 × 10⁹⁸(99-digit number)
30948477952033047083…66125660801331285121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.189 × 10⁹⁸(99-digit number)
61896955904066094166…32251321602662570241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.237 × 10⁹⁹(100-digit number)
12379391180813218833…64502643205325140481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.475 × 10⁹⁹(100-digit number)
24758782361626437666…29005286410650280961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.951 × 10⁹⁹(100-digit number)
49517564723252875333…58010572821300561921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.903 × 10⁹⁹(100-digit number)
99035129446505750666…16021145642601123841
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,695,576 XPM·at block #6,806,435 · 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