Block #557,843

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2014, 5:26:19 AM · Difficulty 10.9630 · 6,248,847 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4fb87aba6fff392d475455b9d4e72446003013f1d96a1c766ddcea55e6dcd4a6

Height

#557,843

Difficulty

10.963046

Transactions

8

Size

1.86 KB

Version

2

Bits

0af68a32

Nonce

50,907,973

Timestamp

5/23/2014, 5:26:19 AM

Confirmations

6,248,847

Merkle Root

84d041de2331adb486361318641cda10feb3889a2517bcb985cac90bb8ece7e1
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.121 × 10⁹⁸(99-digit number)
11219095729811406869…95505438124315970081
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.121 × 10⁹⁸(99-digit number)
11219095729811406869…95505438124315970081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.243 × 10⁹⁸(99-digit number)
22438191459622813738…91010876248631940161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.487 × 10⁹⁸(99-digit number)
44876382919245627476…82021752497263880321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.975 × 10⁹⁸(99-digit number)
89752765838491254952…64043504994527760641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.795 × 10⁹⁹(100-digit number)
17950553167698250990…28087009989055521281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.590 × 10⁹⁹(100-digit number)
35901106335396501980…56174019978111042561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.180 × 10⁹⁹(100-digit number)
71802212670793003961…12348039956222085121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.436 × 10¹⁰⁰(101-digit number)
14360442534158600792…24696079912444170241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.872 × 10¹⁰⁰(101-digit number)
28720885068317201584…49392159824888340481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.744 × 10¹⁰⁰(101-digit number)
57441770136634403169…98784319649776680961
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,697,615 XPM·at block #6,806,689 · 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