Block #547,551

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/16/2014, 1:19:09 PM · Difficulty 10.9573 · 6,261,674 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
49458f08ca40aeb5684480743dc36ab90f381113adde7802e0ac2bd8c67d914e

Height

#547,551

Difficulty

10.957263

Transactions

4

Size

1.16 KB

Version

2

Bits

0af50f37

Nonce

9,835,773

Timestamp

5/16/2014, 1:19:09 PM

Confirmations

6,261,674

Merkle Root

5a9f57b90b8575f6c8c6ff2d2bf9dd04c9cf6e48cbe468878284aa37f7b9b44d
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.

3.312 × 10⁹⁹(100-digit number)
33128664597890975166…48586670751459342079
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
3.312 × 10⁹⁹(100-digit number)
33128664597890975166…48586670751459342079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.625 × 10⁹⁹(100-digit number)
66257329195781950332…97173341502918684159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.325 × 10¹⁰⁰(101-digit number)
13251465839156390066…94346683005837368319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.650 × 10¹⁰⁰(101-digit number)
26502931678312780133…88693366011674736639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.300 × 10¹⁰⁰(101-digit number)
53005863356625560266…77386732023349473279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.060 × 10¹⁰¹(102-digit number)
10601172671325112053…54773464046698946559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.120 × 10¹⁰¹(102-digit number)
21202345342650224106…09546928093397893119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.240 × 10¹⁰¹(102-digit number)
42404690685300448212…19093856186795786239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.480 × 10¹⁰¹(102-digit number)
84809381370600896425…38187712373591572479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.696 × 10¹⁰²(103-digit number)
16961876274120179285…76375424747183144959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.392 × 10¹⁰²(103-digit number)
33923752548240358570…52750849494366289919
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,717,863 XPM·at block #6,809,224 · 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