Block #567,878

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/30/2014, 12:18:01 AM · Difficulty 10.9652 · 6,248,609 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5b0b7135cdc780da4d56d87cafb0fa0fb913f70395d108a268aeaab1977569ba

Height

#567,878

Difficulty

10.965225

Transactions

2

Size

878 B

Version

2

Bits

0af718f9

Nonce

88,265,502

Timestamp

5/30/2014, 12:18:01 AM

Confirmations

6,248,609

Merkle Root

1641dbca1d5ef91229eb7a74bf914c840ddd9d77fc25c4e62864ad8c88136b70
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.

2.701 × 10⁹⁸(99-digit number)
27012901215640319301…76146856370826757441
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.701 × 10⁹⁸(99-digit number)
27012901215640319301…76146856370826757441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.402 × 10⁹⁸(99-digit number)
54025802431280638602…52293712741653514881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.080 × 10⁹⁹(100-digit number)
10805160486256127720…04587425483307029761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.161 × 10⁹⁹(100-digit number)
21610320972512255441…09174850966614059521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.322 × 10⁹⁹(100-digit number)
43220641945024510882…18349701933228119041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.644 × 10⁹⁹(100-digit number)
86441283890049021764…36699403866456238081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.728 × 10¹⁰⁰(101-digit number)
17288256778009804352…73398807732912476161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.457 × 10¹⁰⁰(101-digit number)
34576513556019608705…46797615465824952321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.915 × 10¹⁰⁰(101-digit number)
69153027112039217411…93595230931649904641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.383 × 10¹⁰¹(102-digit number)
13830605422407843482…87190461863299809281
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,776,023 XPM·at block #6,816,486 · 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