Block #502,786

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/20/2014, 3:56:14 PM · Difficulty 10.8077 · 6,304,704 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
64389f9cd60c5a10f6417745dda228e615746547a9f4296aa2617932b2bbebb8

Height

#502,786

Difficulty

10.807728

Transactions

2

Size

648 B

Version

2

Bits

0acec73e

Nonce

105,910

Timestamp

4/20/2014, 3:56:14 PM

Confirmations

6,304,704

Merkle Root

42725b72a686b5e1f6ac008f2362cd29197fa488885665436256111d8df226f3
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.

6.974 × 10⁹⁸(99-digit number)
69743079590671430532…64078426267929433679
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
6.974 × 10⁹⁸(99-digit number)
69743079590671430532…64078426267929433679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.394 × 10⁹⁹(100-digit number)
13948615918134286106…28156852535858867359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.789 × 10⁹⁹(100-digit number)
27897231836268572213…56313705071717734719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.579 × 10⁹⁹(100-digit number)
55794463672537144426…12627410143435469439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.115 × 10¹⁰⁰(101-digit number)
11158892734507428885…25254820286870938879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.231 × 10¹⁰⁰(101-digit number)
22317785469014857770…50509640573741877759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.463 × 10¹⁰⁰(101-digit number)
44635570938029715541…01019281147483755519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.927 × 10¹⁰⁰(101-digit number)
89271141876059431082…02038562294967511039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.785 × 10¹⁰¹(102-digit number)
17854228375211886216…04077124589935022079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.570 × 10¹⁰¹(102-digit number)
35708456750423772432…08154249179870044159
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,703,948 XPM·at block #6,807,489 · 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