Block #402,940

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/13/2014, 7:15:10 PM · Difficulty 10.4358 · 6,414,996 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3328c84e9097f50b8bcd774523885892efa10ba5bf52b62ae321ecd0ae6c1489

Height

#402,940

Difficulty

10.435814

Transactions

2

Size

1015 B

Version

2

Bits

0a6f917f

Nonce

16,128

Timestamp

2/13/2014, 7:15:10 PM

Confirmations

6,414,996

Merkle Root

daf227a341c32f49556a5531e4f7dddd207c014b6fe23232b2df8b90044e564b
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.703 × 10¹⁰¹(102-digit number)
27039154593927458717…99781056318951731201
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.703 × 10¹⁰¹(102-digit number)
27039154593927458717…99781056318951731201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.407 × 10¹⁰¹(102-digit number)
54078309187854917435…99562112637903462401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.081 × 10¹⁰²(103-digit number)
10815661837570983487…99124225275806924801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.163 × 10¹⁰²(103-digit number)
21631323675141966974…98248450551613849601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.326 × 10¹⁰²(103-digit number)
43262647350283933948…96496901103227699201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.652 × 10¹⁰²(103-digit number)
86525294700567867896…92993802206455398401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.730 × 10¹⁰³(104-digit number)
17305058940113573579…85987604412910796801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.461 × 10¹⁰³(104-digit number)
34610117880227147158…71975208825821593601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.922 × 10¹⁰³(104-digit number)
69220235760454294316…43950417651643187201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.384 × 10¹⁰⁴(105-digit number)
13844047152090858863…87900835303286374401
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,787,553 XPM·at block #6,817,935 · 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