Block #222,911

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/22/2013, 1:56:33 PM · Difficulty 9.9395 · 6,593,916 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a41e62ab544299c47871f3db845bb104c535cd1991848d3e3ef4d6b12861d646

Height

#222,911

Difficulty

9.939456

Transactions

8

Size

3.01 KB

Version

2

Bits

09f08038

Nonce

28,219

Timestamp

10/22/2013, 1:56:33 PM

Confirmations

6,593,916

Merkle Root

534da4d676896caf274041b8c957fc70c11950d173007ceb4f0730c64c2fc07a
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.352 × 10⁹⁹(100-digit number)
23523004845648060432…97619331944994816001
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.352 × 10⁹⁹(100-digit number)
23523004845648060432…97619331944994816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.704 × 10⁹⁹(100-digit number)
47046009691296120864…95238663889989632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.409 × 10⁹⁹(100-digit number)
94092019382592241728…90477327779979264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.881 × 10¹⁰⁰(101-digit number)
18818403876518448345…80954655559958528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.763 × 10¹⁰⁰(101-digit number)
37636807753036896691…61909311119917056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.527 × 10¹⁰⁰(101-digit number)
75273615506073793382…23818622239834112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.505 × 10¹⁰¹(102-digit number)
15054723101214758676…47637244479668224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.010 × 10¹⁰¹(102-digit number)
30109446202429517352…95274488959336448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.021 × 10¹⁰¹(102-digit number)
60218892404859034705…90548977918672896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.204 × 10¹⁰²(103-digit number)
12043778480971806941…81097955837345792001
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,778,655 XPM·at block #6,816,826 · 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.
Privacy Policy·

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