Block #319,167

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2013, 8:30:53 PM · Difficulty 10.1657 · 6,491,430 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6f7fb202f5603fcd32a7e9430f8b571dc74bf94d8eed1d80d7280afef84bd3ec

Height

#319,167

Difficulty

10.165687

Transactions

9

Size

3.00 KB

Version

2

Bits

0a2a6a7b

Nonce

63,626

Timestamp

12/18/2013, 8:30:53 PM

Confirmations

6,491,430

Merkle Root

1aab54de1a4f513e85bfbab7588b17b84d41b3b06229da9b41069508ffd4b851
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.991 × 10¹⁰⁴(105-digit number)
49918248322189384830…67808763009328597401
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.991 × 10¹⁰⁴(105-digit number)
49918248322189384830…67808763009328597401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.983 × 10¹⁰⁴(105-digit number)
99836496644378769661…35617526018657194801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.996 × 10¹⁰⁵(106-digit number)
19967299328875753932…71235052037314389601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.993 × 10¹⁰⁵(106-digit number)
39934598657751507864…42470104074628779201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.986 × 10¹⁰⁵(106-digit number)
79869197315503015728…84940208149257558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.597 × 10¹⁰⁶(107-digit number)
15973839463100603145…69880416298515116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.194 × 10¹⁰⁶(107-digit number)
31947678926201206291…39760832597030233601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.389 × 10¹⁰⁶(107-digit number)
63895357852402412583…79521665194060467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.277 × 10¹⁰⁷(108-digit number)
12779071570480482516…59043330388120934401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.555 × 10¹⁰⁷(108-digit number)
25558143140960965033…18086660776241868801
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,728,863 XPM·at block #6,810,596 · 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