Block #403,493

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/14/2014, 5:37:01 AM · Difficulty 10.4287 · 6,411,319 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a85d8c99d391963e8fba70df87301c43edeb93a8047e135f0b1956322eaa2ab6

Height

#403,493

Difficulty

10.428679

Transactions

5

Size

1.79 KB

Version

2

Bits

0a6dbdf0

Nonce

253,390

Timestamp

2/14/2014, 5:37:01 AM

Confirmations

6,411,319

Merkle Root

401b069bac35d722bcdc4e3002e47b0aa4b9591c570a18617bce93bc77b14d5a
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.488 × 10⁹²(93-digit number)
14888711151752424969…03404081331420410241
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.488 × 10⁹²(93-digit number)
14888711151752424969…03404081331420410241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.977 × 10⁹²(93-digit number)
29777422303504849939…06808162662840820481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.955 × 10⁹²(93-digit number)
59554844607009699878…13616325325681640961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.191 × 10⁹³(94-digit number)
11910968921401939975…27232650651363281921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.382 × 10⁹³(94-digit number)
23821937842803879951…54465301302726563841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.764 × 10⁹³(94-digit number)
47643875685607759902…08930602605453127681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.528 × 10⁹³(94-digit number)
95287751371215519805…17861205210906255361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.905 × 10⁹⁴(95-digit number)
19057550274243103961…35722410421812510721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.811 × 10⁹⁴(95-digit number)
38115100548486207922…71444820843625021441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.623 × 10⁹⁴(95-digit number)
76230201096972415844…42889641687250042881
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,762,582 XPM·at block #6,814,811 · 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