Block #2,899,040

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/27/2018, 1:52:28 PM · Difficulty 11.5943 · 3,933,742 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5ee525f01d380bf27241336da22458d089ad241cb64a36cf7c9679721432520c

Height

#2,899,040

Difficulty

11.594315

Transactions

6

Size

1.97 KB

Version

2

Bits

0b982503

Nonce

740,137,050

Timestamp

10/27/2018, 1:52:28 PM

Confirmations

3,933,742

Merkle Root

77e04ac2f8222cd64dfd73eb7b4643729e9a85aeaabe541cea5ea58f368b6765
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.

5.374 × 10⁹⁴(95-digit number)
53749685955651015271…53305569623582091201
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
5.374 × 10⁹⁴(95-digit number)
53749685955651015271…53305569623582091201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.074 × 10⁹⁵(96-digit number)
10749937191130203054…06611139247164182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.149 × 10⁹⁵(96-digit number)
21499874382260406108…13222278494328364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.299 × 10⁹⁵(96-digit number)
42999748764520812217…26444556988656729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.599 × 10⁹⁵(96-digit number)
85999497529041624434…52889113977313459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.719 × 10⁹⁶(97-digit number)
17199899505808324886…05778227954626918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.439 × 10⁹⁶(97-digit number)
34399799011616649773…11556455909253836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.879 × 10⁹⁶(97-digit number)
68799598023233299547…23112911818507673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.375 × 10⁹⁷(98-digit number)
13759919604646659909…46225823637015347201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.751 × 10⁹⁷(98-digit number)
27519839209293319819…92451647274030694401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.503 × 10⁹⁷(98-digit number)
55039678418586639638…84903294548061388801
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,906,422 XPM·at block #6,832,781 · 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