Block #353,141

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2014, 6:29:14 PM · Difficulty 10.3208 · 6,456,340 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9dec1c39fe2ab2c33ba1bf520e136b4c9119fed6c7fa42984f7e720ef67bf1c1

Height

#353,141

Difficulty

10.320838

Transactions

1

Size

208 B

Version

2

Bits

0a522276

Nonce

340,288

Timestamp

1/10/2014, 6:29:14 PM

Confirmations

6,456,340

Merkle Root

8162bfa9431cc752b19c76e3f0ce2ae900003d4d1171351381864fe352857320
Transactions (1)
1 in → 1 out9.3700 XPM116 B
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.983 × 10⁹⁹(100-digit number)
19839561104916511044…75940157118848084481
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.983 × 10⁹⁹(100-digit number)
19839561104916511044…75940157118848084481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.967 × 10⁹⁹(100-digit number)
39679122209833022088…51880314237696168961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.935 × 10⁹⁹(100-digit number)
79358244419666044176…03760628475392337921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.587 × 10¹⁰⁰(101-digit number)
15871648883933208835…07521256950784675841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.174 × 10¹⁰⁰(101-digit number)
31743297767866417670…15042513901569351681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.348 × 10¹⁰⁰(101-digit number)
63486595535732835340…30085027803138703361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.269 × 10¹⁰¹(102-digit number)
12697319107146567068…60170055606277406721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.539 × 10¹⁰¹(102-digit number)
25394638214293134136…20340111212554813441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.078 × 10¹⁰¹(102-digit number)
50789276428586268272…40680222425109626881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.015 × 10¹⁰²(103-digit number)
10157855285717253654…81360444850219253761
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,719,919 XPM·at block #6,809,480 · 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