Block #288,324

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2013, 4:44:14 PM · Difficulty 9.9876 · 6,528,853 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4f2bf0f0988ca52c6ad746d1f96caf818a04b5bff284b03ba7486a6a7fb55720

Height

#288,324

Difficulty

9.987616

Transactions

10

Size

4.53 KB

Version

2

Bits

09fcd464

Nonce

6,885

Timestamp

12/1/2013, 4:44:14 PM

Confirmations

6,528,853

Merkle Root

a618c78cd0b8acf902001bc92885bc173cef53c37565b7fbc33e446931006f8b
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.907 × 10⁹⁹(100-digit number)
19076047942782739367…06242166507346082501
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.907 × 10⁹⁹(100-digit number)
19076047942782739367…06242166507346082501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.815 × 10⁹⁹(100-digit number)
38152095885565478734…12484333014692165001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.630 × 10⁹⁹(100-digit number)
76304191771130957468…24968666029384330001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.526 × 10¹⁰⁰(101-digit number)
15260838354226191493…49937332058768660001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.052 × 10¹⁰⁰(101-digit number)
30521676708452382987…99874664117537320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.104 × 10¹⁰⁰(101-digit number)
61043353416904765974…99749328235074640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.220 × 10¹⁰¹(102-digit number)
12208670683380953194…99498656470149280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.441 × 10¹⁰¹(102-digit number)
24417341366761906389…98997312940298560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.883 × 10¹⁰¹(102-digit number)
48834682733523812779…97994625880597120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.766 × 10¹⁰¹(102-digit number)
97669365467047625559…95989251761194240001
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,781,450 XPM·at block #6,817,176 · 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