Block #3,011,143

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/15/2019, 7:49:01 PM · Difficulty 11.2007 · 3,830,033 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
079f48ed3a88bc4f261299c97fcf9618b48250b96f43321347f70659b3f33b6b

Height

#3,011,143

Difficulty

11.200733

Transactions

5

Size

1.66 KB

Version

2

Bits

0b336344

Nonce

225,102,908

Timestamp

1/15/2019, 7:49:01 PM

Confirmations

3,830,033

Merkle Root

ffea4578f71743bbf3f9a0d22de604e677a05238fe0e34169822a191e9adc488
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.844 × 10⁹⁷(98-digit number)
28441183959184040864…21175876355277736961
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.844 × 10⁹⁷(98-digit number)
28441183959184040864…21175876355277736961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.688 × 10⁹⁷(98-digit number)
56882367918368081728…42351752710555473921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.137 × 10⁹⁸(99-digit number)
11376473583673616345…84703505421110947841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.275 × 10⁹⁸(99-digit number)
22752947167347232691…69407010842221895681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.550 × 10⁹⁸(99-digit number)
45505894334694465382…38814021684443791361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.101 × 10⁹⁸(99-digit number)
91011788669388930765…77628043368887582721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.820 × 10⁹⁹(100-digit number)
18202357733877786153…55256086737775165441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.640 × 10⁹⁹(100-digit number)
36404715467755572306…10512173475550330881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.280 × 10⁹⁹(100-digit number)
72809430935511144612…21024346951100661761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.456 × 10¹⁰⁰(101-digit number)
14561886187102228922…42048693902201323521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.912 × 10¹⁰⁰(101-digit number)
29123772374204457845…84097387804402647041
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,973,766 XPM·at block #6,841,175 · 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