Block #3,020,146

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/22/2019, 5:41:49 AM · Difficulty 11.1639 · 3,824,982 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0056ce6f7645648ef0a06ea70c1627f588c81bfea546118583757cc708f04d28

Height

#3,020,146

Difficulty

11.163851

Transactions

5

Size

2.58 KB

Version

2

Bits

0b29f229

Nonce

342,500,624

Timestamp

1/22/2019, 5:41:49 AM

Confirmations

3,824,982

Merkle Root

71294bff9692715e89c8d159500d6a6aba4ba7ea58a435fadc7fbc5c43413f83
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.

3.653 × 10⁹⁶(97-digit number)
36533824897923454132…51587220881346723841
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
3.653 × 10⁹⁶(97-digit number)
36533824897923454132…51587220881346723841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.306 × 10⁹⁶(97-digit number)
73067649795846908264…03174441762693447681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.461 × 10⁹⁷(98-digit number)
14613529959169381652…06348883525386895361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.922 × 10⁹⁷(98-digit number)
29227059918338763305…12697767050773790721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.845 × 10⁹⁷(98-digit number)
58454119836677526611…25395534101547581441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.169 × 10⁹⁸(99-digit number)
11690823967335505322…50791068203095162881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.338 × 10⁹⁸(99-digit number)
23381647934671010644…01582136406190325761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.676 × 10⁹⁸(99-digit number)
46763295869342021289…03164272812380651521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.352 × 10⁹⁸(99-digit number)
93526591738684042579…06328545624761303041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.870 × 10⁹⁹(100-digit number)
18705318347736808515…12657091249522606081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.741 × 10⁹⁹(100-digit number)
37410636695473617031…25314182499045212161
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:58,005,451 XPM·at block #6,845,127 · 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