Block #331,327

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/27/2013, 7:23:27 AM · Difficulty 10.1666 · 6,486,680 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4af5bf84dc80bd178f676e70fcba3b85399044118c55b5fa5c7d1365abbc2b7b

Height

#331,327

Difficulty

10.166550

Transactions

4

Size

877 B

Version

2

Bits

0a2aa30a

Nonce

137,120

Timestamp

12/27/2013, 7:23:27 AM

Confirmations

6,486,680

Merkle Root

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

9.801 × 10⁹⁵(96-digit number)
98019776902410232945…35464037651687924001
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
9.801 × 10⁹⁵(96-digit number)
98019776902410232945…35464037651687924001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.960 × 10⁹⁶(97-digit number)
19603955380482046589…70928075303375848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.920 × 10⁹⁶(97-digit number)
39207910760964093178…41856150606751696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.841 × 10⁹⁶(97-digit number)
78415821521928186356…83712301213503392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.568 × 10⁹⁷(98-digit number)
15683164304385637271…67424602427006784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.136 × 10⁹⁷(98-digit number)
31366328608771274542…34849204854013568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.273 × 10⁹⁷(98-digit number)
62732657217542549085…69698409708027136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.254 × 10⁹⁸(99-digit number)
12546531443508509817…39396819416054272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.509 × 10⁹⁸(99-digit number)
25093062887017019634…78793638832108544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.018 × 10⁹⁸(99-digit number)
50186125774034039268…57587277664217088001
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,788,121 XPM·at block #6,818,006 · 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