Block #358,454

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/14/2014, 2:45:32 AM · Difficulty 10.3866 · 6,450,625 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3156560b01e5326565136f60abd0a8bcc28feb5e63214f981ea8700a38cdbb17

Height

#358,454

Difficulty

10.386648

Transactions

7

Size

2.94 KB

Version

2

Bits

0a62fb5b

Nonce

62,992

Timestamp

1/14/2014, 2:45:32 AM

Confirmations

6,450,625

Merkle Root

868dd6e87451214ece5ce36adf0d6d70f49e09280480bf440f1b82779220446a
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.176 × 10¹⁰⁰(101-digit number)
21762159912961073160…01521689953811729921
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.176 × 10¹⁰⁰(101-digit number)
21762159912961073160…01521689953811729921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.352 × 10¹⁰⁰(101-digit number)
43524319825922146321…03043379907623459841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.704 × 10¹⁰⁰(101-digit number)
87048639651844292642…06086759815246919681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.740 × 10¹⁰¹(102-digit number)
17409727930368858528…12173519630493839361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.481 × 10¹⁰¹(102-digit number)
34819455860737717057…24347039260987678721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.963 × 10¹⁰¹(102-digit number)
69638911721475434114…48694078521975357441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.392 × 10¹⁰²(103-digit number)
13927782344295086822…97388157043950714881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.785 × 10¹⁰²(103-digit number)
27855564688590173645…94776314087901429761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.571 × 10¹⁰²(103-digit number)
55711129377180347291…89552628175802859521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.114 × 10¹⁰³(104-digit number)
11142225875436069458…79105256351605719041
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,716,693 XPM·at block #6,809,078 · 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