Block #2,633,814

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 3:11:10 PM · Difficulty 11.2094 · 4,206,472 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5022d18d5588e6ebef51ce6e0a862ac6596afe6e441f6a6f041603522aeb7b4d

Height

#2,633,814

Difficulty

11.209393

Transactions

7

Size

1.90 KB

Version

2

Bits

0b359aca

Nonce

38,478,320

Timestamp

4/28/2018, 3:11:10 PM

Confirmations

4,206,472

Merkle Root

f054daf52bbe8cd78629db48b7eb4a8df96ecf0136a7213f1edec71dc0ed082b
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.584 × 10⁹⁴(95-digit number)
35840647307104642542…83676909275733907079
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.584 × 10⁹⁴(95-digit number)
35840647307104642542…83676909275733907079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.168 × 10⁹⁴(95-digit number)
71681294614209285085…67353818551467814159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.433 × 10⁹⁵(96-digit number)
14336258922841857017…34707637102935628319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.867 × 10⁹⁵(96-digit number)
28672517845683714034…69415274205871256639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.734 × 10⁹⁵(96-digit number)
57345035691367428068…38830548411742513279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.146 × 10⁹⁶(97-digit number)
11469007138273485613…77661096823485026559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.293 × 10⁹⁶(97-digit number)
22938014276546971227…55322193646970053119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.587 × 10⁹⁶(97-digit number)
45876028553093942454…10644387293940106239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.175 × 10⁹⁶(97-digit number)
91752057106187884909…21288774587880212479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.835 × 10⁹⁷(98-digit number)
18350411421237576981…42577549175760424959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.670 × 10⁹⁷(98-digit number)
36700822842475153963…85155098351520849919
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,966,604 XPM·at block #6,840,285 · 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