Block #328,868

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/25/2013, 2:14:07 PM · Difficulty 10.1676 · 6,481,856 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c82bfc12817d7195f7873ab2ccb25802692bf2d91e6f40b018232af9db03a3fe

Height

#328,868

Difficulty

10.167648

Transactions

11

Size

42.31 KB

Version

2

Bits

0a2aeafc

Nonce

32,579

Timestamp

12/25/2013, 2:14:07 PM

Confirmations

6,481,856

Merkle Root

5afaf98d52dad40e52bbff4ea59420a34e8741c04f3b109cff520fe20cffa545
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.

5.934 × 10¹⁰²(103-digit number)
59347331273427478663…89626781804467471201
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
5.934 × 10¹⁰²(103-digit number)
59347331273427478663…89626781804467471201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.186 × 10¹⁰³(104-digit number)
11869466254685495732…79253563608934942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.373 × 10¹⁰³(104-digit number)
23738932509370991465…58507127217869884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.747 × 10¹⁰³(104-digit number)
47477865018741982931…17014254435739769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.495 × 10¹⁰³(104-digit number)
94955730037483965862…34028508871479539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.899 × 10¹⁰⁴(105-digit number)
18991146007496793172…68057017742959078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.798 × 10¹⁰⁴(105-digit number)
37982292014993586344…36114035485918156801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.596 × 10¹⁰⁴(105-digit number)
75964584029987172689…72228070971836313601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.519 × 10¹⁰⁵(106-digit number)
15192916805997434537…44456141943672627201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.038 × 10¹⁰⁵(106-digit number)
30385833611994869075…88912283887345254401
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,729,881 XPM·at block #6,810,723 · 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