Block #659,636

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/2/2014, 6:28:40 PM · Difficulty 10.9561 · 6,167,659 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8b26e0c83eb363e67d365afbd0adddebba371094cdfbeca8450348ab3725c122

Height

#659,636

Difficulty

10.956140

Transactions

6

Size

11.72 KB

Version

2

Bits

0af4c593

Nonce

204,731,015

Timestamp

8/2/2014, 6:28:40 PM

Confirmations

6,167,659

Merkle Root

48eabcb112ad504e9d737db8eec0a290df856aefbe30e914a2ad8e4ae121cc17
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.

2.319 × 10⁹⁵(96-digit number)
23192783824633220535…23230041525625797759
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
2.319 × 10⁹⁵(96-digit number)
23192783824633220535…23230041525625797759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.638 × 10⁹⁵(96-digit number)
46385567649266441070…46460083051251595519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.277 × 10⁹⁵(96-digit number)
92771135298532882140…92920166102503191039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.855 × 10⁹⁶(97-digit number)
18554227059706576428…85840332205006382079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.710 × 10⁹⁶(97-digit number)
37108454119413152856…71680664410012764159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.421 × 10⁹⁶(97-digit number)
74216908238826305712…43361328820025528319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.484 × 10⁹⁷(98-digit number)
14843381647765261142…86722657640051056639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.968 × 10⁹⁷(98-digit number)
29686763295530522285…73445315280102113279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.937 × 10⁹⁷(98-digit number)
59373526591061044570…46890630560204226559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.187 × 10⁹⁸(99-digit number)
11874705318212208914…93781261120408453119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.374 × 10⁹⁸(99-digit number)
23749410636424417828…87562522240816906239
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,862,470 XPM·at block #6,827,294 · 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