Block #558,805

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/23/2014, 7:20:43 PM · Difficulty 10.9640 · 6,286,136 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8a6d36e189326dbee612f1705f29f64c4e34841927136b82f09bf74b564c28a1

Height

#558,805

Difficulty

10.963981

Transactions

2

Size

434 B

Version

2

Bits

0af6c772

Nonce

60,571,347

Timestamp

5/23/2014, 7:20:43 PM

Confirmations

6,286,136

Merkle Root

afcf52532c9930a499a4e198fe4ac35df8d1d3d6d8e96a0ea6fe82b6f6124e65
Transactions (2)
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.

3.404 × 10⁹⁸(99-digit number)
34047971631955480791…85932014215812026559
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
3.404 × 10⁹⁸(99-digit number)
34047971631955480791…85932014215812026559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.809 × 10⁹⁸(99-digit number)
68095943263910961583…71864028431624053119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.361 × 10⁹⁹(100-digit number)
13619188652782192316…43728056863248106239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.723 × 10⁹⁹(100-digit number)
27238377305564384633…87456113726496212479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.447 × 10⁹⁹(100-digit number)
54476754611128769266…74912227452992424959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.089 × 10¹⁰⁰(101-digit number)
10895350922225753853…49824454905984849919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.179 × 10¹⁰⁰(101-digit number)
21790701844451507706…99648909811969699839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.358 × 10¹⁰⁰(101-digit number)
43581403688903015413…99297819623939399679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.716 × 10¹⁰⁰(101-digit number)
87162807377806030826…98595639247878799359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.743 × 10¹⁰¹(102-digit number)
17432561475561206165…97191278495757598719
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:58,003,947 XPM·at block #6,844,940 · 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.
Privacy Policy·

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