Block #2,925,814

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/16/2018, 7:35:46 PM · Difficulty 11.3522 · 3,912,980 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cc7183c595e80e2d8026cf55d420459f275d569fdd4e2d49ada6004c669b1493

Height

#2,925,814

Difficulty

11.352196

Transactions

31

Size

8.43 KB

Version

2

Bits

0b5a2982

Nonce

240,057,398

Timestamp

11/16/2018, 7:35:46 PM

Confirmations

3,912,980

Merkle Root

ce7c02a952ef577b9f751d4fd74f6438893a119f714aefbc3445cba3c76b21c8
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.

1.019 × 10⁹⁵(96-digit number)
10194723844869718664…72595229505406771199
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
1.019 × 10⁹⁵(96-digit number)
10194723844869718664…72595229505406771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.038 × 10⁹⁵(96-digit number)
20389447689739437329…45190459010813542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.077 × 10⁹⁵(96-digit number)
40778895379478874658…90380918021627084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.155 × 10⁹⁵(96-digit number)
81557790758957749316…80761836043254169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.631 × 10⁹⁶(97-digit number)
16311558151791549863…61523672086508339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.262 × 10⁹⁶(97-digit number)
32623116303583099726…23047344173016678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.524 × 10⁹⁶(97-digit number)
65246232607166199453…46094688346033356799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.304 × 10⁹⁷(98-digit number)
13049246521433239890…92189376692066713599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.609 × 10⁹⁷(98-digit number)
26098493042866479781…84378753384133427199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.219 × 10⁹⁷(98-digit number)
52196986085732959562…68757506768266854399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.043 × 10⁹⁸(99-digit number)
10439397217146591912…37515013536533708799
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,954,615 XPM·at block #6,838,793 · 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