Block #319,005

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2013, 6:02:39 PM · Difficulty 10.1633 · 6,493,187 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dd06005da3b7a8000f2094bd96718c806edecd3867479d1c5c5b7a3c090f9f63

Height

#319,005

Difficulty

10.163268

Transactions

21

Size

5.62 KB

Version

2

Bits

0a29cbec

Nonce

13,715

Timestamp

12/18/2013, 6:02:39 PM

Confirmations

6,493,187

Merkle Root

0e96833433692acff0a72355a7cd4038664915d626438352eccdeeefda87d505
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.

8.663 × 10⁹⁸(99-digit number)
86635854621610033558…31048925527889208841
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
8.663 × 10⁹⁸(99-digit number)
86635854621610033558…31048925527889208841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.732 × 10⁹⁹(100-digit number)
17327170924322006711…62097851055778417681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.465 × 10⁹⁹(100-digit number)
34654341848644013423…24195702111556835361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.930 × 10⁹⁹(100-digit number)
69308683697288026846…48391404223113670721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.386 × 10¹⁰⁰(101-digit number)
13861736739457605369…96782808446227341441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.772 × 10¹⁰⁰(101-digit number)
27723473478915210738…93565616892454682881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.544 × 10¹⁰⁰(101-digit number)
55446946957830421477…87131233784909365761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.108 × 10¹⁰¹(102-digit number)
11089389391566084295…74262467569818731521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.217 × 10¹⁰¹(102-digit number)
22178778783132168590…48524935139637463041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.435 × 10¹⁰¹(102-digit number)
44357557566264337181…97049870279274926081
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,741,546 XPM·at block #6,812,191 · 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