Block #319,926

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2013, 8:11:06 AM · Difficulty 10.1749 · 6,504,726 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ecc1812aba0baff44c1f694a8e6c55519548507c38ccbf6bb4fcc498c996acd4

Height

#319,926

Difficulty

10.174926

Transactions

11

Size

17.12 KB

Version

2

Bits

0a2cc7ee

Nonce

33,957

Timestamp

12/19/2013, 8:11:06 AM

Confirmations

6,504,726

Merkle Root

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

6.691 × 10⁹⁸(99-digit number)
66917438587844844161…87788916528806289721
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
6.691 × 10⁹⁸(99-digit number)
66917438587844844161…87788916528806289721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.338 × 10⁹⁹(100-digit number)
13383487717568968832…75577833057612579441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.676 × 10⁹⁹(100-digit number)
26766975435137937664…51155666115225158881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.353 × 10⁹⁹(100-digit number)
53533950870275875329…02311332230450317761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.070 × 10¹⁰⁰(101-digit number)
10706790174055175065…04622664460900635521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.141 × 10¹⁰⁰(101-digit number)
21413580348110350131…09245328921801271041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.282 × 10¹⁰⁰(101-digit number)
42827160696220700263…18490657843602542081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.565 × 10¹⁰⁰(101-digit number)
85654321392441400526…36981315687205084161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.713 × 10¹⁰¹(102-digit number)
17130864278488280105…73962631374410168321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.426 × 10¹⁰¹(102-digit number)
34261728556976560210…47925262748820336641
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,841,282 XPM·at block #6,824,651 · 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