Block #2,643,403

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2018, 2:28:27 AM · Difficulty 11.6822 · 4,193,409 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
84d1dcaf4b7b982660e1952cb46ad56b95e474e4541b87e8ef2452b676bd2804

Height

#2,643,403

Difficulty

11.682152

Transactions

9

Size

3.69 KB

Version

2

Bits

0baea189

Nonce

143,677,813

Timestamp

5/2/2018, 2:28:27 AM

Confirmations

4,193,409

Merkle Root

07a10b20fa37057bdc7d4d83804f34f8a9391329c2eab70241c4e84d3aca7810
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.980 × 10⁹⁴(95-digit number)
39802800257596647417…31169335254513397759
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.980 × 10⁹⁴(95-digit number)
39802800257596647417…31169335254513397759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.960 × 10⁹⁴(95-digit number)
79605600515193294834…62338670509026795519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.592 × 10⁹⁵(96-digit number)
15921120103038658966…24677341018053591039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.184 × 10⁹⁵(96-digit number)
31842240206077317933…49354682036107182079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.368 × 10⁹⁵(96-digit number)
63684480412154635867…98709364072214364159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.273 × 10⁹⁶(97-digit number)
12736896082430927173…97418728144428728319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.547 × 10⁹⁶(97-digit number)
25473792164861854347…94837456288857456639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.094 × 10⁹⁶(97-digit number)
50947584329723708694…89674912577714913279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.018 × 10⁹⁷(98-digit number)
10189516865944741738…79349825155429826559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.037 × 10⁹⁷(98-digit number)
20379033731889483477…58699650310859653119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.075 × 10⁹⁷(98-digit number)
40758067463778966955…17399300621719306239
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,938,780 XPM·at block #6,836,811 · 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