Block #3,156,894

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/26/2019, 10:35:45 PM · Difficulty 11.3217 · 3,677,010 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d43132c09d2f52b0fe24c62e00b50cb5c9b6d60ff1090e44ec3d518dd40f4204

Height

#3,156,894

Difficulty

11.321732

Transactions

19

Size

4.51 KB

Version

2

Bits

0b525d01

Nonce

751,298,328

Timestamp

4/26/2019, 10:35:45 PM

Confirmations

3,677,010

Merkle Root

3afe6112fc86d69b60dfe9ccba1a77a24539c546810994f5d5d7723c604a2600
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.

9.137 × 10⁹⁵(96-digit number)
91370682579369618339…16664441846361989121
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
9.137 × 10⁹⁵(96-digit number)
91370682579369618339…16664441846361989121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.827 × 10⁹⁶(97-digit number)
18274136515873923667…33328883692723978241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.654 × 10⁹⁶(97-digit number)
36548273031747847335…66657767385447956481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.309 × 10⁹⁶(97-digit number)
73096546063495694671…33315534770895912961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.461 × 10⁹⁷(98-digit number)
14619309212699138934…66631069541791825921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.923 × 10⁹⁷(98-digit number)
29238618425398277868…33262139083583651841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.847 × 10⁹⁷(98-digit number)
58477236850796555737…66524278167167303681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.169 × 10⁹⁸(99-digit number)
11695447370159311147…33048556334334607361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.339 × 10⁹⁸(99-digit number)
23390894740318622295…66097112668669214721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.678 × 10⁹⁸(99-digit number)
46781789480637244590…32194225337338429441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.356 × 10⁹⁸(99-digit number)
93563578961274489180…64388450674676858881
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,915,458 XPM·at block #6,833,903 · 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