Block #413,126

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/21/2014, 12:34:52 AM · Difficulty 10.4162 · 6,404,344 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
82168944de0dad0902521bb0cba3a95cd5d27ac5e4d495e7133e91372ec6ecbe

Height

#413,126

Difficulty

10.416247

Transactions

8

Size

1.74 KB

Version

2

Bits

0a6a8f2c

Nonce

23,359

Timestamp

2/21/2014, 12:34:52 AM

Confirmations

6,404,344

Merkle Root

66fcc2d520046b7660c34d84c24219f256bd0c91cf1cabe1a3c66fdae1a6f452
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.

6.247 × 10¹⁰²(103-digit number)
62474084870386051454…78012233152595230719
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
6.247 × 10¹⁰²(103-digit number)
62474084870386051454…78012233152595230719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.249 × 10¹⁰³(104-digit number)
12494816974077210290…56024466305190461439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.498 × 10¹⁰³(104-digit number)
24989633948154420581…12048932610380922879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.997 × 10¹⁰³(104-digit number)
49979267896308841163…24097865220761845759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.995 × 10¹⁰³(104-digit number)
99958535792617682327…48195730441523691519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.999 × 10¹⁰⁴(105-digit number)
19991707158523536465…96391460883047383039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.998 × 10¹⁰⁴(105-digit number)
39983414317047072931…92782921766094766079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.996 × 10¹⁰⁴(105-digit number)
79966828634094145862…85565843532189532159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.599 × 10¹⁰⁵(106-digit number)
15993365726818829172…71131687064379064319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.198 × 10¹⁰⁵(106-digit number)
31986731453637658344…42263374128758128639
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,783,811 XPM·at block #6,817,469 · 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