Block #281,524

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2013, 1:34:53 AM · Difficulty 9.9772 · 6,533,439 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7ff43ef6cc2ecbdfe453a586273e18d015192b09ca878bb82f9a5ef00d2a11a7

Height

#281,524

Difficulty

9.977193

Transactions

2

Size

84.36 KB

Version

2

Bits

09fa2952

Nonce

144,491

Timestamp

11/29/2013, 1:34:53 AM

Confirmations

6,533,439

Merkle Root

d0059593b785ede760bc447b332d3ec91a869d9ee42580835d59f43f3ca26b9f
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.

6.338 × 10⁹⁵(96-digit number)
63384738545346540532…82806129052243383041
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
6.338 × 10⁹⁵(96-digit number)
63384738545346540532…82806129052243383041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.267 × 10⁹⁶(97-digit number)
12676947709069308106…65612258104486766081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.535 × 10⁹⁶(97-digit number)
25353895418138616212…31224516208973532161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.070 × 10⁹⁶(97-digit number)
50707790836277232425…62449032417947064321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.014 × 10⁹⁷(98-digit number)
10141558167255446485…24898064835894128641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.028 × 10⁹⁷(98-digit number)
20283116334510892970…49796129671788257281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.056 × 10⁹⁷(98-digit number)
40566232669021785940…99592259343576514561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.113 × 10⁹⁷(98-digit number)
81132465338043571881…99184518687153029121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.622 × 10⁹⁸(99-digit number)
16226493067608714376…98369037374306058241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.245 × 10⁹⁸(99-digit number)
32452986135217428752…96738074748612116481
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,763,789 XPM·at block #6,814,962 · 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