Block #556,340

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/22/2014, 4:59:30 AM · Difficulty 10.9628 · 6,252,796 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8c58072cc0c2e2a99bdcee2df21e2e0a1958990e2397449ac2ae8fd9d9391d07

Height

#556,340

Difficulty

10.962755

Transactions

4

Size

888 B

Version

2

Bits

0af67717

Nonce

45,630,769

Timestamp

5/22/2014, 4:59:30 AM

Confirmations

6,252,796

Merkle Root

51c921bf181cfda82f6d12a7629ef989e22e53f55d50a119da0477ec21254a10
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.

1.604 × 10⁹⁹(100-digit number)
16041265722208415655…80152879992657700319
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
1.604 × 10⁹⁹(100-digit number)
16041265722208415655…80152879992657700319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.208 × 10⁹⁹(100-digit number)
32082531444416831311…60305759985315400639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.416 × 10⁹⁹(100-digit number)
64165062888833662622…20611519970630801279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.283 × 10¹⁰⁰(101-digit number)
12833012577766732524…41223039941261602559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.566 × 10¹⁰⁰(101-digit number)
25666025155533465048…82446079882523205119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.133 × 10¹⁰⁰(101-digit number)
51332050311066930097…64892159765046410239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.026 × 10¹⁰¹(102-digit number)
10266410062213386019…29784319530092820479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.053 × 10¹⁰¹(102-digit number)
20532820124426772039…59568639060185640959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.106 × 10¹⁰¹(102-digit number)
41065640248853544078…19137278120371281919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.213 × 10¹⁰¹(102-digit number)
82131280497707088156…38274556240742563839
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,717,148 XPM·at block #6,809,135 · 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