Block #1,048,875

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/7/2015, 12:01:35 PM · Difficulty 10.7270 · 5,768,921 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e0b4145362340d216019e8c162c112352f4812ef8d9ad89069415e109f2d6a99

Height

#1,048,875

Difficulty

10.727034

Transactions

4

Size

1.00 KB

Version

2

Bits

0aba1edf

Nonce

6,175,744

Timestamp

5/7/2015, 12:01:35 PM

Confirmations

5,768,921

Merkle Root

5be5368569bd210b3f367f451df32f354a8deb0513a80cb63c4579b8a70ddb97
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.394 × 10⁹⁴(95-digit number)
23948900409135162761…94329231933407652401
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.394 × 10⁹⁴(95-digit number)
23948900409135162761…94329231933407652401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.789 × 10⁹⁴(95-digit number)
47897800818270325522…88658463866815304801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.579 × 10⁹⁴(95-digit number)
95795601636540651045…77316927733630609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.915 × 10⁹⁵(96-digit number)
19159120327308130209…54633855467261219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.831 × 10⁹⁵(96-digit number)
38318240654616260418…09267710934522438401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.663 × 10⁹⁵(96-digit number)
76636481309232520836…18535421869044876801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.532 × 10⁹⁶(97-digit number)
15327296261846504167…37070843738089753601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.065 × 10⁹⁶(97-digit number)
30654592523693008334…74141687476179507201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.130 × 10⁹⁶(97-digit number)
61309185047386016669…48283374952359014401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.226 × 10⁹⁷(98-digit number)
12261837009477203333…96566749904718028801
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,786,428 XPM·at block #6,817,795 · 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