Block #318,497

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2013, 9:48:57 AM · Difficulty 10.1605 · 6,495,597 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d587600d7241f1bb416deb4885c2543c6f4b7658301e2ccb2d0e4c654acb1369

Height

#318,497

Difficulty

10.160538

Transactions

3

Size

654 B

Version

2

Bits

0a29190a

Nonce

59,749

Timestamp

12/18/2013, 9:48:57 AM

Confirmations

6,495,597

Merkle Root

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

3.056 × 10⁹⁹(100-digit number)
30560175111206556421…43360703797270334241
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
3.056 × 10⁹⁹(100-digit number)
30560175111206556421…43360703797270334241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.112 × 10⁹⁹(100-digit number)
61120350222413112842…86721407594540668481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.222 × 10¹⁰⁰(101-digit number)
12224070044482622568…73442815189081336961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.444 × 10¹⁰⁰(101-digit number)
24448140088965245136…46885630378162673921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.889 × 10¹⁰⁰(101-digit number)
48896280177930490273…93771260756325347841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.779 × 10¹⁰⁰(101-digit number)
97792560355860980547…87542521512650695681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.955 × 10¹⁰¹(102-digit number)
19558512071172196109…75085043025301391361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.911 × 10¹⁰¹(102-digit number)
39117024142344392219…50170086050602782721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.823 × 10¹⁰¹(102-digit number)
78234048284688784438…00340172101205565441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.564 × 10¹⁰²(103-digit number)
15646809656937756887…00680344202411130881
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,756,834 XPM·at block #6,814,093 · 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