Block #374,294

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/24/2014, 10:17:03 PM · Difficulty 10.4238 · 6,435,478 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5057a0bfbb4ec5383288c270c72158a1387649ac7642daee7667758e1ead881c

Height

#374,294

Difficulty

10.423802

Transactions

3

Size

1.21 KB

Version

2

Bits

0a6c7e46

Nonce

132,706

Timestamp

1/24/2014, 10:17:03 PM

Confirmations

6,435,478

Merkle Root

e9009d29066ec11eedd2c28894b09b0abdebf5bcf51ecbc6ed0a74054c84d88b
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.945 × 10¹⁰⁰(101-digit number)
29454626675899930402…52658070542578360321
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.945 × 10¹⁰⁰(101-digit number)
29454626675899930402…52658070542578360321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.890 × 10¹⁰⁰(101-digit number)
58909253351799860805…05316141085156720641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.178 × 10¹⁰¹(102-digit number)
11781850670359972161…10632282170313441281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.356 × 10¹⁰¹(102-digit number)
23563701340719944322…21264564340626882561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.712 × 10¹⁰¹(102-digit number)
47127402681439888644…42529128681253765121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.425 × 10¹⁰¹(102-digit number)
94254805362879777288…85058257362507530241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.885 × 10¹⁰²(103-digit number)
18850961072575955457…70116514725015060481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.770 × 10¹⁰²(103-digit number)
37701922145151910915…40233029450030120961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.540 × 10¹⁰²(103-digit number)
75403844290303821831…80466058900060241921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.508 × 10¹⁰³(104-digit number)
15080768858060764366…60932117800120483841
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,722,263 XPM·at block #6,809,771 · 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