Block #414,463

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/22/2014, 12:51:27 AM · Difficulty 10.4027 · 6,395,303 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0d690d7a2b4d69a2ab6aed9a44e6b0acaba893eacb4c0d09e45a3dacacecb2f8

Height

#414,463

Difficulty

10.402715

Transactions

7

Size

5.74 KB

Version

2

Bits

0a671850

Nonce

69,236

Timestamp

2/22/2014, 12:51:27 AM

Confirmations

6,395,303

Merkle Root

7c63ea0a38977a90da304418badcfd80bbdfef7eda2f95e66265b85cb225a977
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.579 × 10⁹⁸(99-digit number)
25794062169934009711…15210486114591825921
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.579 × 10⁹⁸(99-digit number)
25794062169934009711…15210486114591825921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.158 × 10⁹⁸(99-digit number)
51588124339868019423…30420972229183651841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.031 × 10⁹⁹(100-digit number)
10317624867973603884…60841944458367303681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.063 × 10⁹⁹(100-digit number)
20635249735947207769…21683888916734607361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.127 × 10⁹⁹(100-digit number)
41270499471894415539…43367777833469214721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.254 × 10⁹⁹(100-digit number)
82540998943788831078…86735555666938429441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.650 × 10¹⁰⁰(101-digit number)
16508199788757766215…73471111333876858881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.301 × 10¹⁰⁰(101-digit number)
33016399577515532431…46942222667753717761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.603 × 10¹⁰⁰(101-digit number)
66032799155031064862…93884445335507435521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.320 × 10¹⁰¹(102-digit number)
13206559831006212972…87768890671014871041
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,722,214 XPM·at block #6,809,765 · 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