Block #3,047,038

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/10/2019, 1:55:08 PM · Difficulty 11.0000 · 3,786,907 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a126c6af002940959773f8fd6c3015588ffa21253ee4c2aa5bb664a7ae98c7fc

Height

#3,047,038

Difficulty

11.000018

Transactions

7

Size

2.48 KB

Version

2

Bits

0b00012c

Nonce

7,402,535

Timestamp

2/10/2019, 1:55:08 PM

Confirmations

3,786,907

Merkle Root

b29aebbfcd2fd20bae5a360046e12a4e9d655574768ad4db621f43664029ba22
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.

4.164 × 10⁹⁷(98-digit number)
41646972890671627593…01857313237997445121
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
4.164 × 10⁹⁷(98-digit number)
41646972890671627593…01857313237997445121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.329 × 10⁹⁷(98-digit number)
83293945781343255186…03714626475994890241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.665 × 10⁹⁸(99-digit number)
16658789156268651037…07429252951989780481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.331 × 10⁹⁸(99-digit number)
33317578312537302074…14858505903979560961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.663 × 10⁹⁸(99-digit number)
66635156625074604148…29717011807959121921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.332 × 10⁹⁹(100-digit number)
13327031325014920829…59434023615918243841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.665 × 10⁹⁹(100-digit number)
26654062650029841659…18868047231836487681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.330 × 10⁹⁹(100-digit number)
53308125300059683319…37736094463672975361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.066 × 10¹⁰⁰(101-digit number)
10661625060011936663…75472188927345950721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.132 × 10¹⁰⁰(101-digit number)
21323250120023873327…50944377854691901441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.264 × 10¹⁰⁰(101-digit number)
42646500240047746655…01888755709383802881
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,788 XPM·at block #6,833,944 · 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