Block #331,553

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/27/2013, 11:04:11 AM · Difficulty 10.1674 · 6,475,816 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
896ea547bf03e6371beb19d194516a2a340d23548766f8632c5fe7aa5d0ec72c

Height

#331,553

Difficulty

10.167443

Transactions

6

Size

1.30 KB

Version

2

Bits

0a2add92

Nonce

156,839

Timestamp

12/27/2013, 11:04:11 AM

Confirmations

6,475,816

Merkle Root

4f15cadafde3a237bf1ab37694c0c87b117db346e9b25264500e549a8f91b1d0
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.

2.180 × 10⁹⁸(99-digit number)
21801999352723811554…50002808609612222081
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
2.180 × 10⁹⁸(99-digit number)
21801999352723811554…50002808609612222081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.360 × 10⁹⁸(99-digit number)
43603998705447623109…00005617219224444161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.720 × 10⁹⁸(99-digit number)
87207997410895246218…00011234438448888321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.744 × 10⁹⁹(100-digit number)
17441599482179049243…00022468876897776641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.488 × 10⁹⁹(100-digit number)
34883198964358098487…00044937753795553281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.976 × 10⁹⁹(100-digit number)
69766397928716196974…00089875507591106561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.395 × 10¹⁰⁰(101-digit number)
13953279585743239394…00179751015182213121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.790 × 10¹⁰⁰(101-digit number)
27906559171486478789…00359502030364426241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.581 × 10¹⁰⁰(101-digit number)
55813118342972957579…00719004060728852481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.116 × 10¹⁰¹(102-digit number)
11162623668594591515…01438008121457704961
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,702,973 XPM·at block #6,807,368 · 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