Block #2,953,568

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2018, 7:43:29 PM · Difficulty 11.4012 · 3,888,529 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
54fe38aa4e7b628a7525d9777d8e20f9807aa9ee8226ec85c00f1393e50201fc

Height

#2,953,568

Difficulty

11.401207

Transactions

31

Size

8.68 KB

Version

2

Bits

0b66b57e

Nonce

160,821,743

Timestamp

12/5/2018, 7:43:29 PM

Confirmations

3,888,529

Merkle Root

a555b0f5fa6b869fd096718ed46a3256692458bdddbd3909ceb209200cdca197
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.196 × 10⁹⁵(96-digit number)
31965215592695443391…73862566176987804719
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.196 × 10⁹⁵(96-digit number)
31965215592695443391…73862566176987804719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.393 × 10⁹⁵(96-digit number)
63930431185390886782…47725132353975609439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.278 × 10⁹⁶(97-digit number)
12786086237078177356…95450264707951218879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.557 × 10⁹⁶(97-digit number)
25572172474156354712…90900529415902437759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.114 × 10⁹⁶(97-digit number)
51144344948312709425…81801058831804875519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.022 × 10⁹⁷(98-digit number)
10228868989662541885…63602117663609751039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.045 × 10⁹⁷(98-digit number)
20457737979325083770…27204235327219502079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.091 × 10⁹⁷(98-digit number)
40915475958650167540…54408470654439004159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.183 × 10⁹⁷(98-digit number)
81830951917300335081…08816941308878008319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.636 × 10⁹⁸(99-digit number)
16366190383460067016…17633882617756016639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.273 × 10⁹⁸(99-digit number)
32732380766920134032…35267765235512033279
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,981,162 XPM·at block #6,842,096 · 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