Block #354,468

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2014, 1:47:21 PM · Difficulty 10.3435 · 6,461,701 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e5ed181e937c1b18332db39f6790a6155c53b7205ed0363ce9f357afab9a540d

Height

#354,468

Difficulty

10.343486

Transactions

8

Size

28.31 KB

Version

2

Bits

0a57eeb4

Nonce

156,105

Timestamp

1/11/2014, 1:47:21 PM

Confirmations

6,461,701

Merkle Root

5455835f69c6692894aabcc8876e57ac7d2b39bd82da647d42cacabe6c00bcd1
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.

9.544 × 10⁹⁶(97-digit number)
95443147749361055918…16890968528625219521
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
9.544 × 10⁹⁶(97-digit number)
95443147749361055918…16890968528625219521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.908 × 10⁹⁷(98-digit number)
19088629549872211183…33781937057250439041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.817 × 10⁹⁷(98-digit number)
38177259099744422367…67563874114500878081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.635 × 10⁹⁷(98-digit number)
76354518199488844734…35127748229001756161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.527 × 10⁹⁸(99-digit number)
15270903639897768946…70255496458003512321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.054 × 10⁹⁸(99-digit number)
30541807279795537893…40510992916007024641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.108 × 10⁹⁸(99-digit number)
61083614559591075787…81021985832014049281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.221 × 10⁹⁹(100-digit number)
12216722911918215157…62043971664028098561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.443 × 10⁹⁹(100-digit number)
24433445823836430315…24087943328056197121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.886 × 10⁹⁹(100-digit number)
48866891647672860630…48175886656112394241
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,773,475 XPM·at block #6,816,168 · 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