Block #253,474

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/10/2013, 4:12:33 AM · Difficulty 9.9722 · 6,554,738 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e28fff06df47f112e677e5daff465ec227c46558b9ff5bcb8e269e46dc152f7c

Height

#253,474

Difficulty

9.972202

Transactions

4

Size

3.05 KB

Version

2

Bits

09f8e23c

Nonce

12,599

Timestamp

11/10/2013, 4:12:33 AM

Confirmations

6,554,738

Merkle Root

68e25fbad7bdd6f16ccf833243957d70900e7f79d904c2a71ffd81d4e0e1dd5e
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.862 × 10⁹⁵(96-digit number)
28628389489062013282…47731671150547434799
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.862 × 10⁹⁵(96-digit number)
28628389489062013282…47731671150547434799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.725 × 10⁹⁵(96-digit number)
57256778978124026565…95463342301094869599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.145 × 10⁹⁶(97-digit number)
11451355795624805313…90926684602189739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.290 × 10⁹⁶(97-digit number)
22902711591249610626…81853369204379478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.580 × 10⁹⁶(97-digit number)
45805423182499221252…63706738408758956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.161 × 10⁹⁶(97-digit number)
91610846364998442504…27413476817517913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.832 × 10⁹⁷(98-digit number)
18322169272999688500…54826953635035827199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.664 × 10⁹⁷(98-digit number)
36644338545999377001…09653907270071654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.328 × 10⁹⁷(98-digit number)
73288677091998754003…19307814540143308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.465 × 10⁹⁸(99-digit number)
14657735418399750800…38615629080286617599
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,709,747 XPM·at block #6,808,211 · 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