Block #342,245

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2014, 10:55:32 PM · Difficulty 10.1550 · 6,468,748 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
462141f78105508f0c9bf648a7ea9884fa14f82df3427d34ae8de0d3117d5fc6

Height

#342,245

Difficulty

10.154982

Transactions

7

Size

2.38 KB

Version

2

Bits

0a27ace8

Nonce

85,085

Timestamp

1/3/2014, 10:55:32 PM

Confirmations

6,468,748

Merkle Root

f8ac0f9d5676969d999aba314532abea068a6a90405122d201654a6a41330189
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.389 × 10⁹⁸(99-digit number)
23891248272077274756…65540933710800739199
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.389 × 10⁹⁸(99-digit number)
23891248272077274756…65540933710800739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.778 × 10⁹⁸(99-digit number)
47782496544154549512…31081867421601478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.556 × 10⁹⁸(99-digit number)
95564993088309099025…62163734843202956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.911 × 10⁹⁹(100-digit number)
19112998617661819805…24327469686405913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.822 × 10⁹⁹(100-digit number)
38225997235323639610…48654939372811827199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.645 × 10⁹⁹(100-digit number)
76451994470647279220…97309878745623654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.529 × 10¹⁰⁰(101-digit number)
15290398894129455844…94619757491247308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.058 × 10¹⁰⁰(101-digit number)
30580797788258911688…89239514982494617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.116 × 10¹⁰⁰(101-digit number)
61161595576517823376…78479029964989235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.223 × 10¹⁰¹(102-digit number)
12232319115303564675…56958059929978470399
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,732,048 XPM·at block #6,810,992 · 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