Block #281,798

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2013, 3:58:39 AM · Difficulty 9.9778 · 6,536,206 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f1f3d9a993b1402ebe8b8eb17c03bdb399bfb4823bf130d11352c6500809c2e0

Height

#281,798

Difficulty

9.977783

Transactions

10

Size

5.00 KB

Version

2

Bits

09fa4ffe

Nonce

10,515

Timestamp

11/29/2013, 3:58:39 AM

Confirmations

6,536,206

Merkle Root

83f3093f04e5fbcce7b85cfc1b5a601fa2cb2f8435ef5e4ca99c79e4b6b32524
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.248 × 10⁹⁹(100-digit number)
12489276023996079594…97584624794073308801
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.248 × 10⁹⁹(100-digit number)
12489276023996079594…97584624794073308801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.497 × 10⁹⁹(100-digit number)
24978552047992159189…95169249588146617601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.995 × 10⁹⁹(100-digit number)
49957104095984318378…90338499176293235201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.991 × 10⁹⁹(100-digit number)
99914208191968636756…80676998352586470401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.998 × 10¹⁰⁰(101-digit number)
19982841638393727351…61353996705172940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.996 × 10¹⁰⁰(101-digit number)
39965683276787454702…22707993410345881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.993 × 10¹⁰⁰(101-digit number)
79931366553574909405…45415986820691763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.598 × 10¹⁰¹(102-digit number)
15986273310714981881…90831973641383526401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.197 × 10¹⁰¹(102-digit number)
31972546621429963762…81663947282767052801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.394 × 10¹⁰¹(102-digit number)
63945093242859927524…63327894565534105601
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,788,097 XPM·at block #6,818,003 · 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