Block #664,576

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/6/2014, 12:13:20 AM · Difficulty 10.9586 · 6,145,993 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
da313d9ba621e8d7bd1b2e7b0ff453f08b71121a6d826e194d1d01e88ec48eed

Height

#664,576

Difficulty

10.958640

Transactions

2

Size

1023 B

Version

2

Bits

0af56974

Nonce

419,690,335

Timestamp

8/6/2014, 12:13:20 AM

Confirmations

6,145,993

Merkle Root

639559a6a24489c5d2bd0ed3f1433566ca3c20130fc3e8ee1927ac6a59f6759e
Transactions (2)
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.926 × 10⁹⁷(98-digit number)
19269609809492696347…60395477655696814081
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.926 × 10⁹⁷(98-digit number)
19269609809492696347…60395477655696814081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.853 × 10⁹⁷(98-digit number)
38539219618985392695…20790955311393628161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.707 × 10⁹⁷(98-digit number)
77078439237970785390…41581910622787256321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.541 × 10⁹⁸(99-digit number)
15415687847594157078…83163821245574512641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.083 × 10⁹⁸(99-digit number)
30831375695188314156…66327642491149025281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.166 × 10⁹⁸(99-digit number)
61662751390376628312…32655284982298050561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.233 × 10⁹⁹(100-digit number)
12332550278075325662…65310569964596101121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.466 × 10⁹⁹(100-digit number)
24665100556150651325…30621139929192202241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.933 × 10⁹⁹(100-digit number)
49330201112301302650…61242279858384404481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.866 × 10⁹⁹(100-digit number)
98660402224602605300…22484559716768808961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.973 × 10¹⁰⁰(101-digit number)
19732080444920521060…44969119433537617921
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,728,643 XPM·at block #6,810,568 · 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