Block #2,801,706

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/20/2018, 5:21:31 AM · Difficulty 11.6702 · 4,042,781 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
15ecf59122da42a6236870c5ae8f7e8c4177485c683f3fae1097aa2e27f9b412

Height

#2,801,706

Difficulty

11.670229

Transactions

71

Size

15.66 KB

Version

2

Bits

0bab941f

Nonce

414,078,252

Timestamp

8/20/2018, 5:21:31 AM

Confirmations

4,042,781

Merkle Root

29848f173c6424bc18b6978d939abcba9705cb077cb5806f0b29566531948520
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.855 × 10⁹⁴(95-digit number)
78552685296019497578…86292646121166300799
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.855 × 10⁹⁴(95-digit number)
78552685296019497578…86292646121166300799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.571 × 10⁹⁵(96-digit number)
15710537059203899515…72585292242332601599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.142 × 10⁹⁵(96-digit number)
31421074118407799031…45170584484665203199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.284 × 10⁹⁵(96-digit number)
62842148236815598063…90341168969330406399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.256 × 10⁹⁶(97-digit number)
12568429647363119612…80682337938660812799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.513 × 10⁹⁶(97-digit number)
25136859294726239225…61364675877321625599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.027 × 10⁹⁶(97-digit number)
50273718589452478450…22729351754643251199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.005 × 10⁹⁷(98-digit number)
10054743717890495690…45458703509286502399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.010 × 10⁹⁷(98-digit number)
20109487435780991380…90917407018573004799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.021 × 10⁹⁷(98-digit number)
40218974871561982760…81834814037146009599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.043 × 10⁹⁷(98-digit number)
80437949743123965520…63669628074292019199
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:58,000,292 XPM·at block #6,844,486 · 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