Block #547,823

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/16/2014, 4:48:26 PM · Difficulty 10.9578 · 6,261,673 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
db54619e1871f53ff910bdfce9646703afd5db0895d0c18484d7b57dc7b98b31

Height

#547,823

Difficulty

10.957826

Transactions

3

Size

660 B

Version

2

Bits

0af53418

Nonce

106,902,929

Timestamp

5/16/2014, 4:48:26 PM

Confirmations

6,261,673

Merkle Root

1ab3601badd08265cc5c0e61757d49acf339650b27214fc752becee9ac41bdc5
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.393 × 10¹⁰⁰(101-digit number)
13939206245391529979…44651223854177008639
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.393 × 10¹⁰⁰(101-digit number)
13939206245391529979…44651223854177008639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.787 × 10¹⁰⁰(101-digit number)
27878412490783059958…89302447708354017279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.575 × 10¹⁰⁰(101-digit number)
55756824981566119917…78604895416708034559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.115 × 10¹⁰¹(102-digit number)
11151364996313223983…57209790833416069119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.230 × 10¹⁰¹(102-digit number)
22302729992626447967…14419581666832138239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.460 × 10¹⁰¹(102-digit number)
44605459985252895934…28839163333664276479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.921 × 10¹⁰¹(102-digit number)
89210919970505791868…57678326667328552959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.784 × 10¹⁰²(103-digit number)
17842183994101158373…15356653334657105919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.568 × 10¹⁰²(103-digit number)
35684367988202316747…30713306669314211839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.136 × 10¹⁰²(103-digit number)
71368735976404633494…61426613338628423679
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,720,040 XPM·at block #6,809,495 · 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