Block #239,411

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/2/2013, 2:13:45 AM · Difficulty 9.9543 · 6,567,940 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b12158d0bb6e4a593ebfc9f800d00d6d1b0c3407e9df0ab2a4bf562075a4bb23

Height

#239,411

Difficulty

9.954309

Transactions

3

Size

19.72 KB

Version

2

Bits

09f44d9d

Nonce

222,506

Timestamp

11/2/2013, 2:13:45 AM

Confirmations

6,567,940

Merkle Root

2917eec16e61e1b99806a639e960d20130d7dc133924fb11cea1d101e592677e
Transactions (3)
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.

4.037 × 10⁹⁷(98-digit number)
40377384894397353058…21009109701162183681
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
4.037 × 10⁹⁷(98-digit number)
40377384894397353058…21009109701162183681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.075 × 10⁹⁷(98-digit number)
80754769788794706116…42018219402324367361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.615 × 10⁹⁸(99-digit number)
16150953957758941223…84036438804648734721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.230 × 10⁹⁸(99-digit number)
32301907915517882446…68072877609297469441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.460 × 10⁹⁸(99-digit number)
64603815831035764893…36145755218594938881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.292 × 10⁹⁹(100-digit number)
12920763166207152978…72291510437189877761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.584 × 10⁹⁹(100-digit number)
25841526332414305957…44583020874379755521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.168 × 10⁹⁹(100-digit number)
51683052664828611914…89166041748759511041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.033 × 10¹⁰⁰(101-digit number)
10336610532965722382…78332083497519022081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.067 × 10¹⁰⁰(101-digit number)
20673221065931444765…56664166995038044161
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,702,829 XPM·at block #6,807,350 · 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