Block #410,706

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/19/2014, 6:19:46 AM · Difficulty 10.4264 · 6,397,453 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d62a4c0f18ac5e218bc085da4f44c62d5ae153edf3a6c0dcb35ccc41e36f1806

Height

#410,706

Difficulty

10.426406

Transactions

3

Size

919 B

Version

2

Bits

0a6d28ea

Nonce

13,911

Timestamp

2/19/2014, 6:19:46 AM

Confirmations

6,397,453

Merkle Root

67edd7d3fda2cbaf6434ce19340ce3f763be6d01a0562036ff3f576c16e3328c
Transactions (3)
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.

2.418 × 10¹⁰¹(102-digit number)
24186008040586398860…48549409152510439201
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
2.418 × 10¹⁰¹(102-digit number)
24186008040586398860…48549409152510439201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.837 × 10¹⁰¹(102-digit number)
48372016081172797721…97098818305020878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.674 × 10¹⁰¹(102-digit number)
96744032162345595443…94197636610041756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.934 × 10¹⁰²(103-digit number)
19348806432469119088…88395273220083513601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.869 × 10¹⁰²(103-digit number)
38697612864938238177…76790546440167027201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.739 × 10¹⁰²(103-digit number)
77395225729876476354…53581092880334054401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.547 × 10¹⁰³(104-digit number)
15479045145975295270…07162185760668108801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.095 × 10¹⁰³(104-digit number)
30958090291950590541…14324371521336217601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.191 × 10¹⁰³(104-digit number)
61916180583901181083…28648743042672435201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.238 × 10¹⁰⁴(105-digit number)
12383236116780236216…57297486085344870401
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,709,317 XPM·at block #6,808,158 · 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.

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