Block #660,265

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/3/2014, 5:06:27 AM · Difficulty 10.9561 · 6,150,839 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
87bb97561c0cccaf030321d91d64fbb3dd6ae8ca395f34a794ff27e6baf0745c

Height

#660,265

Difficulty

10.956091

Transactions

6

Size

1.34 KB

Version

2

Bits

0af4c261

Nonce

1,320,462,305

Timestamp

8/3/2014, 5:06:27 AM

Confirmations

6,150,839

Merkle Root

03c2e1c2b197b00b300c7845e016dd1741f0ef811c02903162c7b6d9a4ca6d7d
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.

4.860 × 10⁹⁷(98-digit number)
48607769768331742793…03347460507883304959
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
4.860 × 10⁹⁷(98-digit number)
48607769768331742793…03347460507883304959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.721 × 10⁹⁷(98-digit number)
97215539536663485587…06694921015766609919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.944 × 10⁹⁸(99-digit number)
19443107907332697117…13389842031533219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.888 × 10⁹⁸(99-digit number)
38886215814665394235…26779684063066439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.777 × 10⁹⁸(99-digit number)
77772431629330788470…53559368126132879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.555 × 10⁹⁹(100-digit number)
15554486325866157694…07118736252265758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.110 × 10⁹⁹(100-digit number)
31108972651732315388…14237472504531517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.221 × 10⁹⁹(100-digit number)
62217945303464630776…28474945009063034879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.244 × 10¹⁰⁰(101-digit number)
12443589060692926155…56949890018126069759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.488 × 10¹⁰⁰(101-digit number)
24887178121385852310…13899780036252139519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.977 × 10¹⁰⁰(101-digit number)
49774356242771704620…27799560072504279039
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,732,939 XPM·at block #6,811,103 · 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