Block #402,368

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/13/2014, 9:46:32 AM · Difficulty 10.4356 · 6,408,327 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f155a8c9be952931c91c37341248b4208ff59399413f2cf413ad8616837764ef

Height

#402,368

Difficulty

10.435576

Transactions

4

Size

1.30 KB

Version

2

Bits

0a6f81ee

Nonce

9,755

Timestamp

2/13/2014, 9:46:32 AM

Confirmations

6,408,327

Merkle Root

4b95944b3a9081023e4eaa1df3f26c6f5b328c9d3a30190d1f8d8b6e9819b413
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.

3.727 × 10⁹⁹(100-digit number)
37273579836584366161…21033958116295030301
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
3.727 × 10⁹⁹(100-digit number)
37273579836584366161…21033958116295030301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.454 × 10⁹⁹(100-digit number)
74547159673168732323…42067916232590060601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.490 × 10¹⁰⁰(101-digit number)
14909431934633746464…84135832465180121201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.981 × 10¹⁰⁰(101-digit number)
29818863869267492929…68271664930360242401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.963 × 10¹⁰⁰(101-digit number)
59637727738534985858…36543329860720484801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.192 × 10¹⁰¹(102-digit number)
11927545547706997171…73086659721440969601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.385 × 10¹⁰¹(102-digit number)
23855091095413994343…46173319442881939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.771 × 10¹⁰¹(102-digit number)
47710182190827988686…92346638885763878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.542 × 10¹⁰¹(102-digit number)
95420364381655977373…84693277771527756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.908 × 10¹⁰²(103-digit number)
19084072876331195474…69386555543055513601
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,729,652 XPM·at block #6,810,694 · 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