Block #331,381

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/27/2013, 8:19:23 AM · Difficulty 10.1662 · 6,478,784 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a2c91df6cb4ecc2366be8a38d69bcbd57e2b6fadfa26c28e667423492a2d1b40

Height

#331,381

Difficulty

10.166190

Transactions

15

Size

5.77 KB

Version

2

Bits

0a2a8b67

Nonce

103,701

Timestamp

12/27/2013, 8:19:23 AM

Confirmations

6,478,784

Merkle Root

992d9cad8415ef209e2c1a7f9d504b381dde9d65260c91d5639e54efe9cfd1af
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.

3.752 × 10¹⁰¹(102-digit number)
37524375326007453984…09097194628687598721
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
3.752 × 10¹⁰¹(102-digit number)
37524375326007453984…09097194628687598721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.504 × 10¹⁰¹(102-digit number)
75048750652014907968…18194389257375197441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.500 × 10¹⁰²(103-digit number)
15009750130402981593…36388778514750394881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.001 × 10¹⁰²(103-digit number)
30019500260805963187…72777557029500789761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.003 × 10¹⁰²(103-digit number)
60039000521611926374…45555114059001579521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.200 × 10¹⁰³(104-digit number)
12007800104322385274…91110228118003159041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.401 × 10¹⁰³(104-digit number)
24015600208644770549…82220456236006318081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.803 × 10¹⁰³(104-digit number)
48031200417289541099…64440912472012636161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.606 × 10¹⁰³(104-digit number)
96062400834579082199…28881824944025272321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.921 × 10¹⁰⁴(105-digit number)
19212480166915816439…57763649888050544641
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,725,387 XPM·at block #6,810,164 · 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