Block #3,010,384

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/15/2019, 7:19:29 AM · Difficulty 11.1995 · 3,831,797 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4a2f710059b53d1ad46b300fc491cc432cf380d297bac27f76fd69d9eaa93603

Height

#3,010,384

Difficulty

11.199533

Transactions

24

Size

7.28 KB

Version

2

Bits

0b331491

Nonce

358,058,606

Timestamp

1/15/2019, 7:19:29 AM

Confirmations

3,831,797

Merkle Root

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

1.821 × 10⁹⁵(96-digit number)
18218636070765039472…35523357223620516401
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
1.821 × 10⁹⁵(96-digit number)
18218636070765039472…35523357223620516401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.643 × 10⁹⁵(96-digit number)
36437272141530078944…71046714447241032801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.287 × 10⁹⁵(96-digit number)
72874544283060157888…42093428894482065601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.457 × 10⁹⁶(97-digit number)
14574908856612031577…84186857788964131201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.914 × 10⁹⁶(97-digit number)
29149817713224063155…68373715577928262401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.829 × 10⁹⁶(97-digit number)
58299635426448126310…36747431155856524801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.165 × 10⁹⁷(98-digit number)
11659927085289625262…73494862311713049601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.331 × 10⁹⁷(98-digit number)
23319854170579250524…46989724623426099201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.663 × 10⁹⁷(98-digit number)
46639708341158501048…93979449246852198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.327 × 10⁹⁷(98-digit number)
93279416682317002096…87958898493704396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.865 × 10⁹⁸(99-digit number)
18655883336463400419…75917796987408793601
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,981,839 XPM·at block #6,842,180 · 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