Block #406,337

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2014, 5:07:54 AM · Difficulty 10.4295 · 6,409,794 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0bab49c0216129c9ecd582728304b3265e1b94ff657d351368d91394e976e126

Height

#406,337

Difficulty

10.429493

Transactions

8

Size

2.75 KB

Version

2

Bits

0a6df341

Nonce

8,892

Timestamp

2/16/2014, 5:07:54 AM

Confirmations

6,409,794

Merkle Root

6aff14f18f9f056193716a88b8d8e43866964e4beecec118a63bf26be3bc1b6d
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.344 × 10⁹⁴(95-digit number)
13440800400343866238…75424532232040165759
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.344 × 10⁹⁴(95-digit number)
13440800400343866238…75424532232040165759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.688 × 10⁹⁴(95-digit number)
26881600800687732477…50849064464080331519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.376 × 10⁹⁴(95-digit number)
53763201601375464955…01698128928160663039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.075 × 10⁹⁵(96-digit number)
10752640320275092991…03396257856321326079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.150 × 10⁹⁵(96-digit number)
21505280640550185982…06792515712642652159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.301 × 10⁹⁵(96-digit number)
43010561281100371964…13585031425285304319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.602 × 10⁹⁵(96-digit number)
86021122562200743928…27170062850570608639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.720 × 10⁹⁶(97-digit number)
17204224512440148785…54340125701141217279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.440 × 10⁹⁶(97-digit number)
34408449024880297571…08680251402282434559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.881 × 10⁹⁶(97-digit number)
68816898049760595142…17360502804564869119
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,773,174 XPM·at block #6,816,130 · 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