Block #555,058

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/21/2014, 7:35:31 AM · Difficulty 10.9627 · 6,261,521 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
61266427f4c3a38bef9079cfdaa92d140f07db0cad16f2ae2ca38ce40145d501

Height

#555,058

Difficulty

10.962694

Transactions

2

Size

468 B

Version

2

Bits

0af67323

Nonce

717,079,330

Timestamp

5/21/2014, 7:35:31 AM

Confirmations

6,261,521

Merkle Root

167a88b9f63e3ad28dbacc98156d8b27e74c2c6bc610ff87aa5cd63f929d187b
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.

4.047 × 10⁹⁸(99-digit number)
40471827391160278746…25598263116177376681
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
4.047 × 10⁹⁸(99-digit number)
40471827391160278746…25598263116177376681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.094 × 10⁹⁸(99-digit number)
80943654782320557492…51196526232354753361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.618 × 10⁹⁹(100-digit number)
16188730956464111498…02393052464709506721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.237 × 10⁹⁹(100-digit number)
32377461912928222996…04786104929419013441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.475 × 10⁹⁹(100-digit number)
64754923825856445993…09572209858838026881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.295 × 10¹⁰⁰(101-digit number)
12950984765171289198…19144419717676053761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.590 × 10¹⁰⁰(101-digit number)
25901969530342578397…38288839435352107521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.180 × 10¹⁰⁰(101-digit number)
51803939060685156794…76577678870704215041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.036 × 10¹⁰¹(102-digit number)
10360787812137031358…53155357741408430081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.072 × 10¹⁰¹(102-digit number)
20721575624274062717…06310715482816860161
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,765 XPM·at block #6,816,578 · 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