Block #651,306

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/28/2014, 3:58:39 AM · Difficulty 10.9535 · 6,159,357 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e6931340c3fdf37f75d1de257b3fe630738a8485bade04c35ae9ec4a04583bbb

Height

#651,306

Difficulty

10.953546

Transactions

7

Size

1.96 KB

Version

2

Bits

0af41b95

Nonce

1,730,186,929

Timestamp

7/28/2014, 3:58:39 AM

Confirmations

6,159,357

Merkle Root

4099dd55884cc9625d53fcb56a19a5980415f1d5787d4bffc1e1c4cb2f95193a
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.

3.067 × 10⁹⁸(99-digit number)
30676496186284831120…81831531252758855679
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
3.067 × 10⁹⁸(99-digit number)
30676496186284831120…81831531252758855679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.135 × 10⁹⁸(99-digit number)
61352992372569662240…63663062505517711359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.227 × 10⁹⁹(100-digit number)
12270598474513932448…27326125011035422719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.454 × 10⁹⁹(100-digit number)
24541196949027864896…54652250022070845439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.908 × 10⁹⁹(100-digit number)
49082393898055729792…09304500044141690879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.816 × 10⁹⁹(100-digit number)
98164787796111459584…18609000088283381759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.963 × 10¹⁰⁰(101-digit number)
19632957559222291916…37218000176566763519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.926 × 10¹⁰⁰(101-digit number)
39265915118444583833…74436000353133527039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.853 × 10¹⁰⁰(101-digit number)
78531830236889167667…48872000706267054079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.570 × 10¹⁰¹(102-digit number)
15706366047377833533…97744001412534108159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.141 × 10¹⁰¹(102-digit number)
31412732094755667067…95488002825068216319
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,729,396 XPM·at block #6,810,662 · 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