Block #407,953

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/17/2014, 8:07:42 AM · Difficulty 10.4292 · 6,406,281 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fda13bcaeda58c635bb22ff00ef8282421b0e62d64593da52d61b2795bf3bcb8

Height

#407,953

Difficulty

10.429247

Transactions

4

Size

2.30 KB

Version

2

Bits

0a6de31d

Nonce

468,793

Timestamp

2/17/2014, 8:07:42 AM

Confirmations

6,406,281

Merkle Root

01c970979c5503abcd65a215ef07998728a78fc3109ea39603679742bb9d3716
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.

4.736 × 10⁹⁹(100-digit number)
47365576177360256749…64159607043673982301
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
4.736 × 10⁹⁹(100-digit number)
47365576177360256749…64159607043673982301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.473 × 10⁹⁹(100-digit number)
94731152354720513499…28319214087347964601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.894 × 10¹⁰⁰(101-digit number)
18946230470944102699…56638428174695929201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.789 × 10¹⁰⁰(101-digit number)
37892460941888205399…13276856349391858401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.578 × 10¹⁰⁰(101-digit number)
75784921883776410799…26553712698783716801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.515 × 10¹⁰¹(102-digit number)
15156984376755282159…53107425397567433601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.031 × 10¹⁰¹(102-digit number)
30313968753510564319…06214850795134867201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.062 × 10¹⁰¹(102-digit number)
60627937507021128639…12429701590269734401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.212 × 10¹⁰²(103-digit number)
12125587501404225727…24859403180539468801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.425 × 10¹⁰²(103-digit number)
24251175002808451455…49718806361078937601
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,757,943 XPM·at block #6,814,233 · 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