Block #409,745

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/18/2014, 2:18:25 PM · Difficulty 10.4280 · 6,414,942 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c57054ed5d5e0200815cd6c130b1fb2bd611578c7d8cb2ad11e3df10e6807d51

Height

#409,745

Difficulty

10.428048

Transactions

5

Size

2.34 KB

Version

2

Bits

0a6d9492

Nonce

576,397

Timestamp

2/18/2014, 2:18:25 PM

Confirmations

6,414,942

Merkle Root

f70d107e445abb49983166dd198530b5d9835290d7ba10ddf13ec8ef382d3f1b
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.053 × 10¹⁰¹(102-digit number)
10533970790114550589…88476200024967270401
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.053 × 10¹⁰¹(102-digit number)
10533970790114550589…88476200024967270401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.106 × 10¹⁰¹(102-digit number)
21067941580229101179…76952400049934540801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.213 × 10¹⁰¹(102-digit number)
42135883160458202359…53904800099869081601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.427 × 10¹⁰¹(102-digit number)
84271766320916404719…07809600199738163201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.685 × 10¹⁰²(103-digit number)
16854353264183280943…15619200399476326401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.370 × 10¹⁰²(103-digit number)
33708706528366561887…31238400798952652801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.741 × 10¹⁰²(103-digit number)
67417413056733123775…62476801597905305601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.348 × 10¹⁰³(104-digit number)
13483482611346624755…24953603195810611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.696 × 10¹⁰³(104-digit number)
26966965222693249510…49907206391621222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.393 × 10¹⁰³(104-digit number)
53933930445386499020…99814412783242444801
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,841,562 XPM·at block #6,824,686 · 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