Block #222,584

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/22/2013, 8:20:35 AM · Difficulty 9.9395 · 6,584,125 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1b7314c62613e6c5e4bd30f1855ded28c84a35eec4d8c0bb13c9ba1218ab134c

Height

#222,584

Difficulty

9.939498

Transactions

3

Size

764 B

Version

2

Bits

09f082f7

Nonce

147,509

Timestamp

10/22/2013, 8:20:35 AM

Confirmations

6,584,125

Merkle Root

d2e12759f74d0e77fbd5052e1c62d601831a87ce49f3d93e981a4f24bf5afe97
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.

1.448 × 10⁹⁰(91-digit number)
14487854888605978379…18938225057880299959
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.448 × 10⁹⁰(91-digit number)
14487854888605978379…18938225057880299959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.897 × 10⁹⁰(91-digit number)
28975709777211956759…37876450115760599919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.795 × 10⁹⁰(91-digit number)
57951419554423913518…75752900231521199839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.159 × 10⁹¹(92-digit number)
11590283910884782703…51505800463042399679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.318 × 10⁹¹(92-digit number)
23180567821769565407…03011600926084799359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.636 × 10⁹¹(92-digit number)
46361135643539130814…06023201852169598719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.272 × 10⁹¹(92-digit number)
92722271287078261629…12046403704339197439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.854 × 10⁹²(93-digit number)
18544454257415652325…24092807408678394879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.708 × 10⁹²(93-digit number)
37088908514831304651…48185614817356789759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.417 × 10⁹²(93-digit number)
74177817029662609303…96371229634713579519
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,697,769 XPM·at block #6,806,708 · 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