Block #342,219

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2014, 10:41:26 PM · Difficulty 10.1533 · 6,466,452 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dfbd9405cf727ffa59ede2d19bd754c83f22b43751046ecbc210def13e55b8e7

Height

#342,219

Difficulty

10.153342

Transactions

1

Size

1.05 KB

Version

2

Bits

0a274167

Nonce

3,926

Timestamp

1/3/2014, 10:41:26 PM

Confirmations

6,466,452

Merkle Root

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

4.733 × 10⁹⁹(100-digit number)
47339055922576250788…64878267957624809601
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
4.733 × 10⁹⁹(100-digit number)
47339055922576250788…64878267957624809601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.467 × 10⁹⁹(100-digit number)
94678111845152501577…29756535915249619201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.893 × 10¹⁰⁰(101-digit number)
18935622369030500315…59513071830499238401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.787 × 10¹⁰⁰(101-digit number)
37871244738061000630…19026143660998476801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.574 × 10¹⁰⁰(101-digit number)
75742489476122001261…38052287321996953601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.514 × 10¹⁰¹(102-digit number)
15148497895224400252…76104574643993907201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.029 × 10¹⁰¹(102-digit number)
30296995790448800504…52209149287987814401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.059 × 10¹⁰¹(102-digit number)
60593991580897601009…04418298575975628801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.211 × 10¹⁰²(103-digit number)
12118798316179520201…08836597151951257601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.423 × 10¹⁰²(103-digit number)
24237596632359040403…17673194303902515201
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,713,413 XPM·at block #6,808,670 · 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