Block #467,984

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/31/2014, 4:55:04 AM · Difficulty 10.4312 · 6,344,651 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5a0017fd5a814a2ed738d67ba885f52231e5bb83d66cab7551c0bb9916528e71

Height

#467,984

Difficulty

10.431153

Transactions

14

Size

3.61 KB

Version

2

Bits

0a6e6011

Nonce

589,482

Timestamp

3/31/2014, 4:55:04 AM

Confirmations

6,344,651

Merkle Root

56ebba0a20da4118423e7eabaeac835229923ce721f5bb0e2bcb4324bb7acf32
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.241 × 10⁹⁸(99-digit number)
12414728589388826136…33696294688334978331
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.241 × 10⁹⁸(99-digit number)
12414728589388826136…33696294688334978331
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.482 × 10⁹⁸(99-digit number)
24829457178777652272…67392589376669956661
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.965 × 10⁹⁸(99-digit number)
49658914357555304544…34785178753339913321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.931 × 10⁹⁸(99-digit number)
99317828715110609089…69570357506679826641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.986 × 10⁹⁹(100-digit number)
19863565743022121817…39140715013359653281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.972 × 10⁹⁹(100-digit number)
39727131486044243635…78281430026719306561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.945 × 10⁹⁹(100-digit number)
79454262972088487271…56562860053438613121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.589 × 10¹⁰⁰(101-digit number)
15890852594417697454…13125720106877226241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.178 × 10¹⁰⁰(101-digit number)
31781705188835394908…26251440213754452481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.356 × 10¹⁰⁰(101-digit number)
63563410377670789817…52502880427508904961
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,745,116 XPM·at block #6,812,634 · 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