Block #499,719

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/18/2014, 6:07:24 PM · Difficulty 10.7946 · 6,327,128 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bf499de9363c1c3170de9c6ee4df8f59580c3d4e53a370472c20fd8d9a76e2e8

Height

#499,719

Difficulty

10.794637

Transactions

2

Size

398 B

Version

2

Bits

0acb6d54

Nonce

543,396,159

Timestamp

4/18/2014, 6:07:24 PM

Confirmations

6,327,128

Merkle Root

7363ef48e9a36bbbec076a333675c0dd4cc59994986c91d6bfc89b417c4767b0
Transactions (2)
1 in → 1 out8.5800 XPM116 B
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.

4.248 × 10⁹⁷(98-digit number)
42481348315055243842…45408445560975375761
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
4.248 × 10⁹⁷(98-digit number)
42481348315055243842…45408445560975375761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.496 × 10⁹⁷(98-digit number)
84962696630110487685…90816891121950751521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.699 × 10⁹⁸(99-digit number)
16992539326022097537…81633782243901503041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.398 × 10⁹⁸(99-digit number)
33985078652044195074…63267564487803006081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.797 × 10⁹⁸(99-digit number)
67970157304088390148…26535128975606012161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.359 × 10⁹⁹(100-digit number)
13594031460817678029…53070257951212024321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.718 × 10⁹⁹(100-digit number)
27188062921635356059…06140515902424048641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.437 × 10⁹⁹(100-digit number)
54376125843270712118…12281031804848097281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.087 × 10¹⁰⁰(101-digit number)
10875225168654142423…24562063609696194561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.175 × 10¹⁰⁰(101-digit number)
21750450337308284847…49124127219392389121
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,858,942 XPM·at block #6,826,846 · 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