Block #268,409

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/22/2013, 2:52:31 AM · Difficulty 9.9572 · 6,521,629 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e403f88dc120ae5cf4f75fca825660faf564e18225e66ae74d8f5c19a56be1ab

Height

#268,409

Difficulty

9.957194

Transactions

5

Size

5.70 KB

Version

2

Bits

09f50aa4

Nonce

34,469

Timestamp

11/22/2013, 2:52:31 AM

Confirmations

6,521,629

Merkle Root

a58bc69309bfd7cccfbfa27fc518473eab5996b6a67e95f2f54b4881f5427a4c
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.023 × 10¹⁰²(103-digit number)
10232731441700566489…28332142158247316739
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.023 × 10¹⁰²(103-digit number)
10232731441700566489…28332142158247316739
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.046 × 10¹⁰²(103-digit number)
20465462883401132979…56664284316494633479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.093 × 10¹⁰²(103-digit number)
40930925766802265959…13328568632989266959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.186 × 10¹⁰²(103-digit number)
81861851533604531919…26657137265978533919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.637 × 10¹⁰³(104-digit number)
16372370306720906383…53314274531957067839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.274 × 10¹⁰³(104-digit number)
32744740613441812767…06628549063914135679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.548 × 10¹⁰³(104-digit number)
65489481226883625535…13257098127828271359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.309 × 10¹⁰⁴(105-digit number)
13097896245376725107…26514196255656542719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.619 × 10¹⁰⁴(105-digit number)
26195792490753450214…53028392511313085439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.239 × 10¹⁰⁴(105-digit number)
52391584981506900428…06056785022626170879
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,564,285 XPM·at block #6,790,037 · updates every 60s