Block #640,018

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/19/2014, 8:35:03 PM · Difficulty 10.9591 · 6,166,793 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f12fa49fabb85eeab207ddf27f9b1f5e7694c513cdf2a88ef1579d4f5c7bb78b

Height

#640,018

Difficulty

10.959063

Transactions

2

Size

503 B

Version

2

Bits

0af58527

Nonce

12,994,127

Timestamp

7/19/2014, 8:35:03 PM

Confirmations

6,166,793

Merkle Root

433e441826064d9638b7c4c3dc9f43eb59452dd184ed0615b4a314f5207bba33
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.

5.317 × 10⁹⁸(99-digit number)
53172006521218351035…50215354085340139521
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
5.317 × 10⁹⁸(99-digit number)
53172006521218351035…50215354085340139521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.063 × 10⁹⁹(100-digit number)
10634401304243670207…00430708170680279041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.126 × 10⁹⁹(100-digit number)
21268802608487340414…00861416341360558081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.253 × 10⁹⁹(100-digit number)
42537605216974680828…01722832682721116161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.507 × 10⁹⁹(100-digit number)
85075210433949361656…03445665365442232321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.701 × 10¹⁰⁰(101-digit number)
17015042086789872331…06891330730884464641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.403 × 10¹⁰⁰(101-digit number)
34030084173579744662…13782661461768929281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.806 × 10¹⁰⁰(101-digit number)
68060168347159489324…27565322923537858561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.361 × 10¹⁰¹(102-digit number)
13612033669431897864…55130645847075717121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.722 × 10¹⁰¹(102-digit number)
27224067338863795729…10261291694151434241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.444 × 10¹⁰¹(102-digit number)
54448134677727591459…20522583388302868481
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,698,588 XPM·at block #6,806,810 · 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