Block #2,929,689

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/19/2018, 8:01:11 AM · Difficulty 11.3836 · 3,888,244 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1fef4fa573ce1f041b4508f2ef56b2614d27dcbdb0a83eee64acf51855ebf150

Height

#2,929,689

Difficulty

11.383613

Transactions

5

Size

1.99 KB

Version

2

Bits

0b623474

Nonce

940,065,869

Timestamp

11/19/2018, 8:01:11 AM

Confirmations

3,888,244

Merkle Root

81e06840f373ab1bf3961ca024dc61877692b175219dcbab3ef2d39003fd1a0d
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.733 × 10⁹⁵(96-digit number)
77330864473584100374…49130554853682931199
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.733 × 10⁹⁵(96-digit number)
77330864473584100374…49130554853682931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.546 × 10⁹⁶(97-digit number)
15466172894716820074…98261109707365862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.093 × 10⁹⁶(97-digit number)
30932345789433640149…96522219414731724799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.186 × 10⁹⁶(97-digit number)
61864691578867280299…93044438829463449599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.237 × 10⁹⁷(98-digit number)
12372938315773456059…86088877658926899199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.474 × 10⁹⁷(98-digit number)
24745876631546912119…72177755317853798399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.949 × 10⁹⁷(98-digit number)
49491753263093824239…44355510635707596799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.898 × 10⁹⁷(98-digit number)
98983506526187648479…88711021271415193599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.979 × 10⁹⁸(99-digit number)
19796701305237529695…77422042542830387199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.959 × 10⁹⁸(99-digit number)
39593402610475059391…54844085085660774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.918 × 10⁹⁸(99-digit number)
79186805220950118783…09688170171321548799
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,787,529 XPM·at block #6,817,932 · 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