Block #546,681

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/16/2014, 12:26:32 AM · Difficulty 10.9564 · 6,277,878 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a00178ebd56167c2d99fd0643a525fcf692e86549d158bacf7766e165a95e4d3

Height

#546,681

Difficulty

10.956430

Transactions

6

Size

1.71 KB

Version

2

Bits

0af4d894

Nonce

1,303,499,513

Timestamp

5/16/2014, 12:26:32 AM

Confirmations

6,277,878

Merkle Root

6c2560a55f27a7492153d76817a6fe394cb28cccabcae6a89be9422e31844808
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.009 × 10⁹⁹(100-digit number)
90091849394455171343…98162578140068556799
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.009 × 10⁹⁹(100-digit number)
90091849394455171343…98162578140068556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.801 × 10¹⁰⁰(101-digit number)
18018369878891034268…96325156280137113599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.603 × 10¹⁰⁰(101-digit number)
36036739757782068537…92650312560274227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.207 × 10¹⁰⁰(101-digit number)
72073479515564137074…85300625120548454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.441 × 10¹⁰¹(102-digit number)
14414695903112827414…70601250241096908799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.882 × 10¹⁰¹(102-digit number)
28829391806225654829…41202500482193817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.765 × 10¹⁰¹(102-digit number)
57658783612451309659…82405000964387635199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.153 × 10¹⁰²(103-digit number)
11531756722490261931…64810001928775270399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.306 × 10¹⁰²(103-digit number)
23063513444980523863…29620003857550540799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.612 × 10¹⁰²(103-digit number)
46127026889961047727…59240007715101081599
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,840,536 XPM·at block #6,824,558 · 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