Block #556,109

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/22/2014, 12:47:47 AM · Difficulty 10.9629 · 6,256,661 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ca3a794ea3902889372d46d02a9cfdacde9d45d243d88d15ff17f8a2d2eb3c2a

Height

#556,109

Difficulty

10.962897

Transactions

4

Size

1.15 KB

Version

2

Bits

0af6806e

Nonce

353,701,306

Timestamp

5/22/2014, 12:47:47 AM

Confirmations

6,256,661

Merkle Root

775becd7ff814aba7a1e79ec25461c3c4f2af2ab0aec46a183b0cbea8a1655e2
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.

5.814 × 10⁹⁸(99-digit number)
58148253004382100653…26436344854767941999
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
5.814 × 10⁹⁸(99-digit number)
58148253004382100653…26436344854767941999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.162 × 10⁹⁹(100-digit number)
11629650600876420130…52872689709535883999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.325 × 10⁹⁹(100-digit number)
23259301201752840261…05745379419071767999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.651 × 10⁹⁹(100-digit number)
46518602403505680523…11490758838143535999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.303 × 10⁹⁹(100-digit number)
93037204807011361046…22981517676287071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.860 × 10¹⁰⁰(101-digit number)
18607440961402272209…45963035352574143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.721 × 10¹⁰⁰(101-digit number)
37214881922804544418…91926070705148287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.442 × 10¹⁰⁰(101-digit number)
74429763845609088837…83852141410296575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.488 × 10¹⁰¹(102-digit number)
14885952769121817767…67704282820593151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.977 × 10¹⁰¹(102-digit number)
29771905538243635534…35408565641186303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.954 × 10¹⁰¹(102-digit number)
59543811076487271069…70817131282372607999
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,746,199 XPM·at block #6,812,769 · 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