Block #3,141,470

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2019, 6:02:31 AM · Difficulty 11.3170 · 3,697,165 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f6d844f912f74b31338e00653aa06445bd7e801a68975c8e47ff3ce04dc7c502

Height

#3,141,470

Difficulty

11.317039

Transactions

2

Size

2.76 KB

Version

2

Bits

0b512980

Nonce

153,861,556

Timestamp

4/16/2019, 6:02:31 AM

Confirmations

3,697,165

Merkle Root

fcba8255d19252feed216988c1b9a4ba244124fb7fa835a9ac7ac7f36939c0f7
Transactions (2)
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.

2.399 × 10⁹⁵(96-digit number)
23996432717305179659…20736115117372578559
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
2.399 × 10⁹⁵(96-digit number)
23996432717305179659…20736115117372578559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.799 × 10⁹⁵(96-digit number)
47992865434610359319…41472230234745157119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.598 × 10⁹⁵(96-digit number)
95985730869220718639…82944460469490314239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.919 × 10⁹⁶(97-digit number)
19197146173844143727…65888920938980628479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.839 × 10⁹⁶(97-digit number)
38394292347688287455…31777841877961256959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.678 × 10⁹⁶(97-digit number)
76788584695376574911…63555683755922513919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.535 × 10⁹⁷(98-digit number)
15357716939075314982…27111367511845027839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.071 × 10⁹⁷(98-digit number)
30715433878150629964…54222735023690055679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.143 × 10⁹⁷(98-digit number)
61430867756301259929…08445470047380111359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.228 × 10⁹⁸(99-digit number)
12286173551260251985…16890940094760222719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.457 × 10⁹⁸(99-digit number)
24572347102520503971…33781880189520445439
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,953,343 XPM·at block #6,838,634 · 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