Block #434,101

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/8/2014, 1:16:31 AM · Difficulty 10.3449 · 6,390,388 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
01d5515feeb8e2de7ffb150b6c50dc707e27d3f50cce85e8cd70d3dc92f15193

Height

#434,101

Difficulty

10.344930

Transactions

3

Size

1.06 KB

Version

2

Bits

0a584d4f

Nonce

146,310

Timestamp

3/8/2014, 1:16:31 AM

Confirmations

6,390,388

Merkle Root

503b92b19070f01b31b186cc171fb7d5e9673ffd4be5c518bb6d652c46e09750
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.644 × 10⁹⁶(97-digit number)
16447600864651335188…65144965746340195841
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.644 × 10⁹⁶(97-digit number)
16447600864651335188…65144965746340195841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.289 × 10⁹⁶(97-digit number)
32895201729302670376…30289931492680391681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.579 × 10⁹⁶(97-digit number)
65790403458605340753…60579862985360783361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.315 × 10⁹⁷(98-digit number)
13158080691721068150…21159725970721566721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.631 × 10⁹⁷(98-digit number)
26316161383442136301…42319451941443133441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.263 × 10⁹⁷(98-digit number)
52632322766884272602…84638903882886266881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.052 × 10⁹⁸(99-digit number)
10526464553376854520…69277807765772533761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.105 × 10⁹⁸(99-digit number)
21052929106753709041…38555615531545067521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.210 × 10⁹⁸(99-digit number)
42105858213507418082…77111231063090135041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.421 × 10⁹⁸(99-digit number)
84211716427014836164…54222462126180270081
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,839,983 XPM·at block #6,824,488 · 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