Block #503,547

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/21/2014, 4:08:59 AM · Difficulty 10.8089 · 6,323,555 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
adf937ede9b3f2ffc49e043f1ba865f8ff9646fffe59d90a1990a75a8dc9aa0d

Height

#503,547

Difficulty

10.808907

Transactions

2

Size

1.00 KB

Version

2

Bits

0acf1486

Nonce

1,101,972,194

Timestamp

4/21/2014, 4:08:59 AM

Confirmations

6,323,555

Merkle Root

16c80e847980484b6270c779f0debb56990110cefcf36459b075a7441aa2b550
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.388 × 10⁹⁸(99-digit number)
43884341466700016944…24690951154184933119
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.388 × 10⁹⁸(99-digit number)
43884341466700016944…24690951154184933119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.776 × 10⁹⁸(99-digit number)
87768682933400033888…49381902308369866239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.755 × 10⁹⁹(100-digit number)
17553736586680006777…98763804616739732479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.510 × 10⁹⁹(100-digit number)
35107473173360013555…97527609233479464959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.021 × 10⁹⁹(100-digit number)
70214946346720027110…95055218466958929919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.404 × 10¹⁰⁰(101-digit number)
14042989269344005422…90110436933917859839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.808 × 10¹⁰⁰(101-digit number)
28085978538688010844…80220873867835719679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.617 × 10¹⁰⁰(101-digit number)
56171957077376021688…60441747735671439359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.123 × 10¹⁰¹(102-digit number)
11234391415475204337…20883495471342878719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.246 × 10¹⁰¹(102-digit number)
22468782830950408675…41766990942685757439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.493 × 10¹⁰¹(102-digit number)
44937565661900817350…83533981885371514879
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,860,993 XPM·at block #6,827,101 · 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