Block #308,769

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2013, 6:56:32 AM · Difficulty 9.9946 · 6,499,448 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
53aa79e46c041c0f3b929697558194ac9800a7c8595afa75f33245db7453a229

Height

#308,769

Difficulty

9.994612

Transactions

1

Size

1.15 KB

Version

2

Bits

09fe9ee7

Nonce

1,645

Timestamp

12/13/2013, 6:56:32 AM

Confirmations

6,499,448

Merkle Root

b7351c219bafbf12c54d2946b4638540250ad80b3d7cf7010080548813631cc0
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.921 × 10⁹⁸(99-digit number)
39212619211926628809…77632572991062328321
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.921 × 10⁹⁸(99-digit number)
39212619211926628809…77632572991062328321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.842 × 10⁹⁸(99-digit number)
78425238423853257618…55265145982124656641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.568 × 10⁹⁹(100-digit number)
15685047684770651523…10530291964249313281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.137 × 10⁹⁹(100-digit number)
31370095369541303047…21060583928498626561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.274 × 10⁹⁹(100-digit number)
62740190739082606094…42121167856997253121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.254 × 10¹⁰⁰(101-digit number)
12548038147816521218…84242335713994506241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.509 × 10¹⁰⁰(101-digit number)
25096076295633042437…68484671427989012481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.019 × 10¹⁰⁰(101-digit number)
50192152591266084875…36969342855978024961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.003 × 10¹⁰¹(102-digit number)
10038430518253216975…73938685711956049921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.007 × 10¹⁰¹(102-digit number)
20076861036506433950…47877371423912099841
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,709,787 XPM·at block #6,808,216 · 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