Block #557,557

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/23/2014, 12:45:28 AM · Difficulty 10.9630 · 6,249,329 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0351a4c50f0a1aed8d2840ddc7ef0b366a7b6c32411236625c01ef4d3655f28b

Height

#557,557

Difficulty

10.962988

Transactions

4

Size

1.58 KB

Version

2

Bits

0af6865a

Nonce

414,154,573

Timestamp

5/23/2014, 12:45:28 AM

Confirmations

6,249,329

Merkle Root

7776aadd7d5e24423486ee994d960ce5e991111e5b292b9bb43722ccd6881a60
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.055 × 10⁹⁸(99-digit number)
90557799648625151652…15121707062721609599
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.055 × 10⁹⁸(99-digit number)
90557799648625151652…15121707062721609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.811 × 10⁹⁹(100-digit number)
18111559929725030330…30243414125443219199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.622 × 10⁹⁹(100-digit number)
36223119859450060660…60486828250886438399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.244 × 10⁹⁹(100-digit number)
72446239718900121321…20973656501772876799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.448 × 10¹⁰⁰(101-digit number)
14489247943780024264…41947313003545753599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.897 × 10¹⁰⁰(101-digit number)
28978495887560048528…83894626007091507199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.795 × 10¹⁰⁰(101-digit number)
57956991775120097057…67789252014183014399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.159 × 10¹⁰¹(102-digit number)
11591398355024019411…35578504028366028799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.318 × 10¹⁰¹(102-digit number)
23182796710048038822…71157008056732057599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.636 × 10¹⁰¹(102-digit number)
46365593420096077645…42314016113464115199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.273 × 10¹⁰¹(102-digit number)
92731186840192155291…84628032226928230399
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,699,195 XPM·at block #6,806,885 · 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