Block #341,541

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2014, 12:38:31 PM · Difficulty 10.1401 · 6,499,550 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d1cffe55b8652fe120a80f90a697b7f1a46ac3c95f7f0d3262af55e9ebdb85b7

Height

#341,541

Difficulty

10.140106

Transactions

2

Size

426 B

Version

2

Bits

0a23ddfa

Nonce

66,658

Timestamp

1/3/2014, 12:38:31 PM

Confirmations

6,499,550

Merkle Root

6698b3cf402b8620bc58b79117375b5799c33cf327b2a1fa128a5e09d97efd5b
Transactions (2)
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.

5.459 × 10⁹⁷(98-digit number)
54595893317427704321…68038411018167171091
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
5.459 × 10⁹⁷(98-digit number)
54595893317427704321…68038411018167171091
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.091 × 10⁹⁸(99-digit number)
10919178663485540864…36076822036334342181
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.183 × 10⁹⁸(99-digit number)
21838357326971081728…72153644072668684361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.367 × 10⁹⁸(99-digit number)
43676714653942163457…44307288145337368721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.735 × 10⁹⁸(99-digit number)
87353429307884326915…88614576290674737441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.747 × 10⁹⁹(100-digit number)
17470685861576865383…77229152581349474881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.494 × 10⁹⁹(100-digit number)
34941371723153730766…54458305162698949761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.988 × 10⁹⁹(100-digit number)
69882743446307461532…08916610325397899521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.397 × 10¹⁰⁰(101-digit number)
13976548689261492306…17833220650795799041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.795 × 10¹⁰⁰(101-digit number)
27953097378522984612…35666441301591598081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.590 × 10¹⁰⁰(101-digit number)
55906194757045969225…71332882603183196161
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,973,092 XPM·at block #6,841,090 · 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