Block #502,796

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/20/2014, 4:05:32 PM · Difficulty 10.8078 · 6,307,032 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5164c9b8d8a0eab076ec3ef369766eeb2eb8c561705bfa1489df13543637f468

Height

#502,796

Difficulty

10.807848

Transactions

2

Size

1.00 KB

Version

2

Bits

0acecf19

Nonce

497,894,965

Timestamp

4/20/2014, 4:05:32 PM

Confirmations

6,307,032

Merkle Root

fadc748173594efcca74fde9e6631ef48a508e6f4fed67afe1412590cfa50285
Transactions (2)
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.782 × 10⁹⁶(97-digit number)
97828343794665641619…33283357947456177919
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.782 × 10⁹⁶(97-digit number)
97828343794665641619…33283357947456177919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.956 × 10⁹⁷(98-digit number)
19565668758933128323…66566715894912355839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.913 × 10⁹⁷(98-digit number)
39131337517866256647…33133431789824711679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.826 × 10⁹⁷(98-digit number)
78262675035732513295…66266863579649423359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.565 × 10⁹⁸(99-digit number)
15652535007146502659…32533727159298846719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.130 × 10⁹⁸(99-digit number)
31305070014293005318…65067454318597693439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.261 × 10⁹⁸(99-digit number)
62610140028586010636…30134908637195386879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.252 × 10⁹⁹(100-digit number)
12522028005717202127…60269817274390773759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.504 × 10⁹⁹(100-digit number)
25044056011434404254…20539634548781547519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.008 × 10⁹⁹(100-digit number)
50088112022868808509…41079269097563095039
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,722,709 XPM·at block #6,809,827 · 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