Block #363,039

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 3:29:38 AM · Difficulty 10.4180 · 6,443,531 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e8b2c13d4089d7a50cf5b6344959b63cbe7d4b0924113596634e4660aee88c29

Height

#363,039

Difficulty

10.418038

Transactions

3

Size

1.53 KB

Version

2

Bits

0a6b0484

Nonce

10,615

Timestamp

1/17/2014, 3:29:38 AM

Confirmations

6,443,531

Merkle Root

9b1d8196f2098e05223922fa90645b4a47940bbd26021adf86a2662ce69997e3
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.185 × 10⁹⁹(100-digit number)
21854958374424623437…01318502848054858241
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.185 × 10⁹⁹(100-digit number)
21854958374424623437…01318502848054858241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.370 × 10⁹⁹(100-digit number)
43709916748849246874…02637005696109716481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.741 × 10⁹⁹(100-digit number)
87419833497698493748…05274011392219432961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.748 × 10¹⁰⁰(101-digit number)
17483966699539698749…10548022784438865921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.496 × 10¹⁰⁰(101-digit number)
34967933399079397499…21096045568877731841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.993 × 10¹⁰⁰(101-digit number)
69935866798158794998…42192091137755463681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.398 × 10¹⁰¹(102-digit number)
13987173359631758999…84384182275510927361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.797 × 10¹⁰¹(102-digit number)
27974346719263517999…68768364551021854721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.594 × 10¹⁰¹(102-digit number)
55948693438527035998…37536729102043709441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.118 × 10¹⁰²(103-digit number)
11189738687705407199…75073458204087418881
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,696,657 XPM·at block #6,806,569 · 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