Block #664,611

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/6/2014, 12:43:04 AM · Difficulty 10.9587 · 6,149,613 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5c8999aeedb70abbc4de99d10f916e4d2e6a986cb9ed0a6fdc165741b9d0f01c

Height

#664,611

Difficulty

10.958673

Transactions

8

Size

2.47 KB

Version

2

Bits

0af56ba0

Nonce

313,335,218

Timestamp

8/6/2014, 12:43:04 AM

Confirmations

6,149,613

Merkle Root

07aab3bbc6eb88adf0b074d180797614f346bc0f3b30ac4effa1b31789230470
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.

7.755 × 10⁹⁴(95-digit number)
77559922496487799671…93895225886734485119
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
7.755 × 10⁹⁴(95-digit number)
77559922496487799671…93895225886734485119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.551 × 10⁹⁵(96-digit number)
15511984499297559934…87790451773468970239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.102 × 10⁹⁵(96-digit number)
31023968998595119868…75580903546937940479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.204 × 10⁹⁵(96-digit number)
62047937997190239737…51161807093875880959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.240 × 10⁹⁶(97-digit number)
12409587599438047947…02323614187751761919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.481 × 10⁹⁶(97-digit number)
24819175198876095895…04647228375503523839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.963 × 10⁹⁶(97-digit number)
49638350397752191790…09294456751007047679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.927 × 10⁹⁶(97-digit number)
99276700795504383580…18588913502014095359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.985 × 10⁹⁷(98-digit number)
19855340159100876716…37177827004028190719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.971 × 10⁹⁷(98-digit number)
39710680318201753432…74355654008056381439
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,757,862 XPM·at block #6,814,223 · 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.
Privacy Policy·

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