Block #552,100

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/19/2014, 6:16:05 AM · Difficulty 10.9626 · 6,255,260 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
241bc77f35e601d68a1091a3f2daaa7197297152253d30db9b4496748b70198b

Height

#552,100

Difficulty

10.962604

Transactions

4

Size

853 B

Version

2

Bits

0af66d3c

Nonce

40,940,436

Timestamp

5/19/2014, 6:16:05 AM

Confirmations

6,255,260

Merkle Root

274402017aff964f131ea76267b6b6ea15deb199be531d3aa1ba24f3696de340
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.

6.412 × 10¹⁰⁰(101-digit number)
64122155555999369879…57156152578989030399
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
6.412 × 10¹⁰⁰(101-digit number)
64122155555999369879…57156152578989030399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.282 × 10¹⁰¹(102-digit number)
12824431111199873975…14312305157978060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.564 × 10¹⁰¹(102-digit number)
25648862222399747951…28624610315956121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.129 × 10¹⁰¹(102-digit number)
51297724444799495903…57249220631912243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.025 × 10¹⁰²(103-digit number)
10259544888959899180…14498441263824486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.051 × 10¹⁰²(103-digit number)
20519089777919798361…28996882527648972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.103 × 10¹⁰²(103-digit number)
41038179555839596722…57993765055297945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.207 × 10¹⁰²(103-digit number)
82076359111679193445…15987530110595891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.641 × 10¹⁰³(104-digit number)
16415271822335838689…31975060221191782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.283 × 10¹⁰³(104-digit number)
32830543644671677378…63950120442383564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.566 × 10¹⁰³(104-digit number)
65661087289343354756…27900240884767129599
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,702,902 XPM·at block #6,807,359 · 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