Block #84,026

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/26/2013, 1:12:06 PM · Difficulty 9.2722 · 6,724,534 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8ad162af5f79950763830cd91c6213f0b2b2e3453d9d6d9a61223da42e16dac9

Height

#84,026

Difficulty

9.272211

Transactions

2

Size

724 B

Version

2

Bits

0945afa7

Nonce

60,191

Timestamp

7/26/2013, 1:12:06 PM

Confirmations

6,724,534

Merkle Root

fe2edfae96bea0c3506ed48189d266c20326016f0c899953eee0ac42a2a911ff
Transactions (2)
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.809 × 10¹⁰³(104-digit number)
18098678274270337476…18189972486367134001
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.809 × 10¹⁰³(104-digit number)
18098678274270337476…18189972486367134001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.619 × 10¹⁰³(104-digit number)
36197356548540674952…36379944972734268001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.239 × 10¹⁰³(104-digit number)
72394713097081349904…72759889945468536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.447 × 10¹⁰⁴(105-digit number)
14478942619416269980…45519779890937072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.895 × 10¹⁰⁴(105-digit number)
28957885238832539961…91039559781874144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.791 × 10¹⁰⁴(105-digit number)
57915770477665079923…82079119563748288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.158 × 10¹⁰⁵(106-digit number)
11583154095533015984…64158239127496576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.316 × 10¹⁰⁵(106-digit number)
23166308191066031969…28316478254993152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.633 × 10¹⁰⁵(106-digit number)
46332616382132063938…56632956509986304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.266 × 10¹⁰⁵(106-digit number)
92665232764264127877…13265913019972608001
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,712,538 XPM·at block #6,808,559 · 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.

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