Block #2,950,497

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/3/2018, 5:07:05 PM · Difficulty 11.3968 · 3,886,604 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cd9b78f425926664fc9030d02794c51c74fe208009e9800b0f50121758602c50

Height

#2,950,497

Difficulty

11.396837

Transactions

7

Size

2.58 KB

Version

2

Bits

0b659720

Nonce

945,591,642

Timestamp

12/3/2018, 5:07:05 PM

Confirmations

3,886,604

Merkle Root

5de7ec668fd248ed41c01a8b1a1df73f145936a60e2dbd55d69875e6dbf8805c
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.858 × 10⁹⁵(96-digit number)
28583076820967391905…84122822604561251521
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.858 × 10⁹⁵(96-digit number)
28583076820967391905…84122822604561251521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.716 × 10⁹⁵(96-digit number)
57166153641934783810…68245645209122503041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.143 × 10⁹⁶(97-digit number)
11433230728386956762…36491290418245006081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.286 × 10⁹⁶(97-digit number)
22866461456773913524…72982580836490012161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.573 × 10⁹⁶(97-digit number)
45732922913547827048…45965161672980024321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.146 × 10⁹⁶(97-digit number)
91465845827095654097…91930323345960048641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.829 × 10⁹⁷(98-digit number)
18293169165419130819…83860646691920097281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.658 × 10⁹⁷(98-digit number)
36586338330838261638…67721293383840194561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.317 × 10⁹⁷(98-digit number)
73172676661676523277…35442586767680389121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.463 × 10⁹⁸(99-digit number)
14634535332335304655…70885173535360778241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.926 × 10⁹⁸(99-digit number)
29269070664670609311…41770347070721556481
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,941,115 XPM·at block #6,837,100 · 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