Block #268,658

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/22/2013, 7:35:44 AM · Difficulty 9.9569 · 6,522,281 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
25df039b2d35925edb40ff368e54af641d5529027539eb87123c94fb24829bee

Height

#268,658

Difficulty

9.956910

Transactions

7

Size

2.17 KB

Version

2

Bits

09f4f80e

Nonce

29,250

Timestamp

11/22/2013, 7:35:44 AM

Confirmations

6,522,281

Merkle Root

02e05180aae0168c0d99cfa7a2c216356603e03283e64c44fe979cdf5d1c82a1
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.

2.482 × 10⁹⁷(98-digit number)
24821681669010153834…17771101796586856961
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
2.482 × 10⁹⁷(98-digit number)
24821681669010153834…17771101796586856961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.964 × 10⁹⁷(98-digit number)
49643363338020307668…35542203593173713921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.928 × 10⁹⁷(98-digit number)
99286726676040615336…71084407186347427841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.985 × 10⁹⁸(99-digit number)
19857345335208123067…42168814372694855681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.971 × 10⁹⁸(99-digit number)
39714690670416246134…84337628745389711361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.942 × 10⁹⁸(99-digit number)
79429381340832492269…68675257490779422721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.588 × 10⁹⁹(100-digit number)
15885876268166498453…37350514981558845441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.177 × 10⁹⁹(100-digit number)
31771752536332996907…74701029963117690881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.354 × 10⁹⁹(100-digit number)
63543505072665993815…49402059926235381761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.270 × 10¹⁰⁰(101-digit number)
12708701014533198763…98804119852470763521
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,571,529 XPM·at block #6,790,938 · updates every 60s