Block #410,838

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/19/2014, 8:31:16 AM · Difficulty 10.4289 · 6,416,272 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2b1195c73dcf61ffdedb3a360b41508f27c3f3f0f0d1295e971dc3e0ebf5a1a0

Height

#410,838

Difficulty

10.428910

Transactions

2

Size

1.13 KB

Version

2

Bits

0a6dcd14

Nonce

1,368

Timestamp

2/19/2014, 8:31:16 AM

Confirmations

6,416,272

Merkle Root

1319d4c44b6662f5e5d2be237e17a9f613529375cd84fcb832abf2391f5dc31e
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.287 × 10⁹⁷(98-digit number)
32875711796707782956…77049835168382233599
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.287 × 10⁹⁷(98-digit number)
32875711796707782956…77049835168382233599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.575 × 10⁹⁷(98-digit number)
65751423593415565913…54099670336764467199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.315 × 10⁹⁸(99-digit number)
13150284718683113182…08199340673528934399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.630 × 10⁹⁸(99-digit number)
26300569437366226365…16398681347057868799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.260 × 10⁹⁸(99-digit number)
52601138874732452731…32797362694115737599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.052 × 10⁹⁹(100-digit number)
10520227774946490546…65594725388231475199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.104 × 10⁹⁹(100-digit number)
21040455549892981092…31189450776462950399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.208 × 10⁹⁹(100-digit number)
42080911099785962184…62378901552925900799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.416 × 10⁹⁹(100-digit number)
84161822199571924369…24757803105851801599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.683 × 10¹⁰⁰(101-digit number)
16832364439914384873…49515606211703603199
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,861,059 XPM·at block #6,827,109 · 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