Block #406,210

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2014, 2:46:55 AM · Difficulty 10.4310 · 6,403,455 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
97d200963d3ccb0e2dc440bdd9ce2f693de8e614f9cda522a1e0390a6806e6b6

Height

#406,210

Difficulty

10.430972

Transactions

6

Size

1.59 KB

Version

2

Bits

0a6e542a

Nonce

164,211

Timestamp

2/16/2014, 2:46:55 AM

Confirmations

6,403,455

Merkle Root

73a64c16f2d89ce360bed4bb6c6d4c146dca6cf3bd12b3d52cc212d626ed5881
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.965 × 10⁹⁸(99-digit number)
39652053679358926926…43045875984409329901
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.965 × 10⁹⁸(99-digit number)
39652053679358926926…43045875984409329901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.930 × 10⁹⁸(99-digit number)
79304107358717853852…86091751968818659801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.586 × 10⁹⁹(100-digit number)
15860821471743570770…72183503937637319601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.172 × 10⁹⁹(100-digit number)
31721642943487141540…44367007875274639201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.344 × 10⁹⁹(100-digit number)
63443285886974283081…88734015750549278401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.268 × 10¹⁰⁰(101-digit number)
12688657177394856616…77468031501098556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.537 × 10¹⁰⁰(101-digit number)
25377314354789713232…54936063002197113601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.075 × 10¹⁰⁰(101-digit number)
50754628709579426465…09872126004394227201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.015 × 10¹⁰¹(102-digit number)
10150925741915885293…19744252008788454401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.030 × 10¹⁰¹(102-digit number)
20301851483831770586…39488504017576908801
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,721,394 XPM·at block #6,809,664 · 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