Block #475,842

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/5/2014, 11:45:31 AM · Difficulty 10.4624 · 6,341,248 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0b568f19fd5594109e769b94e227f95ce6ab83a151400942a21d6f3a15b66825

Height

#475,842

Difficulty

10.462429

Transactions

3

Size

1.18 KB

Version

2

Bits

0a7661b9

Nonce

33,554,652

Timestamp

4/5/2014, 11:45:31 AM

Confirmations

6,341,248

Merkle Root

a307855082376b363ac75e289aeff19c265e1e31e3edb501654c99527d895747
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.010 × 10⁹⁹(100-digit number)
40100933180388994081…54543000852828097251
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.010 × 10⁹⁹(100-digit number)
40100933180388994081…54543000852828097251
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.020 × 10⁹⁹(100-digit number)
80201866360777988163…09086001705656194501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.604 × 10¹⁰⁰(101-digit number)
16040373272155597632…18172003411312389001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.208 × 10¹⁰⁰(101-digit number)
32080746544311195265…36344006822624778001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.416 × 10¹⁰⁰(101-digit number)
64161493088622390531…72688013645249556001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.283 × 10¹⁰¹(102-digit number)
12832298617724478106…45376027290499112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.566 × 10¹⁰¹(102-digit number)
25664597235448956212…90752054580998224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.132 × 10¹⁰¹(102-digit number)
51329194470897912424…81504109161996448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.026 × 10¹⁰²(103-digit number)
10265838894179582484…63008218323992896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.053 × 10¹⁰²(103-digit number)
20531677788359164969…26016436647985792001
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,780,759 XPM·at block #6,817,089 · 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