Block #499,423

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/18/2014, 2:51:34 PM · Difficulty 10.7906 · 6,337,252 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
477007806f0e7453f40ad0cf5387b0b781853850dfdab87a99b21194c5972ccb

Height

#499,423

Difficulty

10.790585

Transactions

4

Size

1.01 KB

Version

2

Bits

0aca63cc

Nonce

200,753,115

Timestamp

4/18/2014, 2:51:34 PM

Confirmations

6,337,252

Merkle Root

853ac9048e7d78393a1d57ef723495197a5f9dcd65fe37e5afbe36820959a8a6
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.

9.977 × 10⁹⁷(98-digit number)
99771129414198452717…69855341856258357999
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
9.977 × 10⁹⁷(98-digit number)
99771129414198452717…69855341856258357999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.995 × 10⁹⁸(99-digit number)
19954225882839690543…39710683712516715999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.990 × 10⁹⁸(99-digit number)
39908451765679381087…79421367425033431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.981 × 10⁹⁸(99-digit number)
79816903531358762174…58842734850066863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.596 × 10⁹⁹(100-digit number)
15963380706271752434…17685469700133727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.192 × 10⁹⁹(100-digit number)
31926761412543504869…35370939400267455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.385 × 10⁹⁹(100-digit number)
63853522825087009739…70741878800534911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.277 × 10¹⁰⁰(101-digit number)
12770704565017401947…41483757601069823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.554 × 10¹⁰⁰(101-digit number)
25541409130034803895…82967515202139647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.108 × 10¹⁰⁰(101-digit number)
51082818260069607791…65935030404279295999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,937,679 XPM·at block #6,836,674 · 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