Block #503,657

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/21/2014, 5:56:11 AM · Difficulty 10.8090 · 6,302,658 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
34d3007f593d22ef59e1579b73b8dc1b8f90a9771082c93c4aa0e570878e686f

Height

#503,657

Difficulty

10.808979

Transactions

2

Size

583 B

Version

2

Bits

0acf1939

Nonce

15,081,515

Timestamp

4/21/2014, 5:56:11 AM

Confirmations

6,302,658

Merkle Root

a4d886eea9be6a29380a20d45b75988577d47c663c8f3d4a64fcc4073b98dd27
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.

4.331 × 10⁹⁹(100-digit number)
43311052232454463381…00146814954832409599
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.331 × 10⁹⁹(100-digit number)
43311052232454463381…00146814954832409599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.662 × 10⁹⁹(100-digit number)
86622104464908926762…00293629909664819199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.732 × 10¹⁰⁰(101-digit number)
17324420892981785352…00587259819329638399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.464 × 10¹⁰⁰(101-digit number)
34648841785963570705…01174519638659276799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.929 × 10¹⁰⁰(101-digit number)
69297683571927141410…02349039277318553599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.385 × 10¹⁰¹(102-digit number)
13859536714385428282…04698078554637107199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.771 × 10¹⁰¹(102-digit number)
27719073428770856564…09396157109274214399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.543 × 10¹⁰¹(102-digit number)
55438146857541713128…18792314218548428799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.108 × 10¹⁰²(103-digit number)
11087629371508342625…37584628437096857599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.217 × 10¹⁰²(103-digit number)
22175258743016685251…75169256874193715199
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,694,601 XPM·at block #6,806,314 · 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