Block #552,901

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/19/2014, 7:09:51 PM · Difficulty 10.9628 · 6,255,072 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cf803cb60f3718031c3964cc1a0818eb73ca0c46d0497a285a1b84103e049a83

Height

#552,901

Difficulty

10.962838

Transactions

11

Size

7.69 KB

Version

2

Bits

0af67c90

Nonce

43,632,600

Timestamp

5/19/2014, 7:09:51 PM

Confirmations

6,255,072

Merkle Root

54b3340827d95cdf82d19d9ca182d81859781f00094ba86225496cb246a1e68d
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.566 × 10⁹⁹(100-digit number)
95660808545272737520…97604807938467343359
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.566 × 10⁹⁹(100-digit number)
95660808545272737520…97604807938467343359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.913 × 10¹⁰⁰(101-digit number)
19132161709054547504…95209615876934686719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.826 × 10¹⁰⁰(101-digit number)
38264323418109095008…90419231753869373439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.652 × 10¹⁰⁰(101-digit number)
76528646836218190016…80838463507738746879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.530 × 10¹⁰¹(102-digit number)
15305729367243638003…61676927015477493759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.061 × 10¹⁰¹(102-digit number)
30611458734487276006…23353854030954987519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.122 × 10¹⁰¹(102-digit number)
61222917468974552012…46707708061909975039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.224 × 10¹⁰²(103-digit number)
12244583493794910402…93415416123819950079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.448 × 10¹⁰²(103-digit number)
24489166987589820805…86830832247639900159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.897 × 10¹⁰²(103-digit number)
48978333975179641610…73661664495279800319
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,707,828 XPM·at block #6,807,972 · 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