Block #557,022

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/22/2014, 4:19:02 PM · Difficulty 10.9628 · 6,253,435 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3343c26d51e78b9a03a40d4580af4618ce62404f399fb39778c33b20fd6951f5

Height

#557,022

Difficulty

10.962760

Transactions

9

Size

2.26 KB

Version

2

Bits

0af67770

Nonce

28,105,571

Timestamp

5/22/2014, 4:19:02 PM

Confirmations

6,253,435

Merkle Root

4800497a62da8be2bba63b07203d5eb5aeb8ca80ec4c29824bdfa3cfc6a75950
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.067 × 10⁹⁸(99-digit number)
10677120568340315794…94710487630744396159
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.067 × 10⁹⁸(99-digit number)
10677120568340315794…94710487630744396159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.135 × 10⁹⁸(99-digit number)
21354241136680631588…89420975261488792319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.270 × 10⁹⁸(99-digit number)
42708482273361263177…78841950522977584639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.541 × 10⁹⁸(99-digit number)
85416964546722526355…57683901045955169279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.708 × 10⁹⁹(100-digit number)
17083392909344505271…15367802091910338559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.416 × 10⁹⁹(100-digit number)
34166785818689010542…30735604183820677119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.833 × 10⁹⁹(100-digit number)
68333571637378021084…61471208367641354239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.366 × 10¹⁰⁰(101-digit number)
13666714327475604216…22942416735282708479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.733 × 10¹⁰⁰(101-digit number)
27333428654951208433…45884833470565416959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.466 × 10¹⁰⁰(101-digit number)
54666857309902416867…91769666941130833919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.093 × 10¹⁰¹(102-digit number)
10933371461980483373…83539333882261667839
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,727,743 XPM·at block #6,810,456 · 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