Block #563,389

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/26/2014, 9:57:20 PM · Difficulty 10.9649 · 6,251,079 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d959f7039fcc92114a2c33c90ff1c543a95dca44475366ec86efc7b749f7498b

Height

#563,389

Difficulty

10.964886

Transactions

4

Size

1.73 KB

Version

2

Bits

0af702c6

Nonce

9,539,015

Timestamp

5/26/2014, 9:57:20 PM

Confirmations

6,251,079

Merkle Root

e5fe00e22effba532c7b048d195a551a93c1934d5f91def2154107c5eaaf6099
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.

2.187 × 10⁹⁸(99-digit number)
21879809283466145999…11122996544764401279
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
2.187 × 10⁹⁸(99-digit number)
21879809283466145999…11122996544764401279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.375 × 10⁹⁸(99-digit number)
43759618566932291999…22245993089528802559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.751 × 10⁹⁸(99-digit number)
87519237133864583998…44491986179057605119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.750 × 10⁹⁹(100-digit number)
17503847426772916799…88983972358115210239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.500 × 10⁹⁹(100-digit number)
35007694853545833599…77967944716230420479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.001 × 10⁹⁹(100-digit number)
70015389707091667198…55935889432460840959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.400 × 10¹⁰⁰(101-digit number)
14003077941418333439…11871778864921681919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.800 × 10¹⁰⁰(101-digit number)
28006155882836666879…23743557729843363839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.601 × 10¹⁰⁰(101-digit number)
56012311765673333759…47487115459686727679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.120 × 10¹⁰¹(102-digit number)
11202462353134666751…94974230919373455359
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:57,759,817 XPM·at block #6,814,467 · 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