Block #658,296

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/1/2014, 7:50:21 PM · Difficulty 10.9562 · 6,149,650 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0059f96d6d0b7976cd0b438da6219ae3b8fc24ffde9c21265df4458a95fd12b6

Height

#658,296

Difficulty

10.956242

Transactions

4

Size

6.61 KB

Version

2

Bits

0af4cc41

Nonce

60,208,462

Timestamp

8/1/2014, 7:50:21 PM

Confirmations

6,149,650

Merkle Root

5a4b90593292332d2c98215a8d510468f7978fbfbb0654f3f5449cd291bd9e85
Transactions (4)
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.

8.517 × 10⁹⁶(97-digit number)
85171183986977948725…43546631020985855999
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
8.517 × 10⁹⁶(97-digit number)
85171183986977948725…43546631020985855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.703 × 10⁹⁷(98-digit number)
17034236797395589745…87093262041971711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.406 × 10⁹⁷(98-digit number)
34068473594791179490…74186524083943423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.813 × 10⁹⁷(98-digit number)
68136947189582358980…48373048167886847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.362 × 10⁹⁸(99-digit number)
13627389437916471796…96746096335773695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.725 × 10⁹⁸(99-digit number)
27254778875832943592…93492192671547391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.450 × 10⁹⁸(99-digit number)
54509557751665887184…86984385343094783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.090 × 10⁹⁹(100-digit number)
10901911550333177436…73968770686189567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.180 × 10⁹⁹(100-digit number)
21803823100666354873…47937541372379135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.360 × 10⁹⁹(100-digit number)
43607646201332709747…95875082744758271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.721 × 10⁹⁹(100-digit number)
87215292402665419494…91750165489516543999
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 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
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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,707,608 XPM·at block #6,807,945 · 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