Block #310,882

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2013, 7:09:32 AM · Difficulty 9.9953 · 6,500,267 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1dd7d0f00274c6eb60285551420b0ba5899710a2ac3f251176f0c39f7b6d03f7

Height

#310,882

Difficulty

9.995316

Transactions

12

Size

27.76 KB

Version

2

Bits

09fecd0f

Nonce

22,978

Timestamp

12/14/2013, 7:09:32 AM

Confirmations

6,500,267

Merkle Root

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

1.577 × 10⁹⁹(100-digit number)
15776418007694937131…24163391514849505281
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
1.577 × 10⁹⁹(100-digit number)
15776418007694937131…24163391514849505281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.155 × 10⁹⁹(100-digit number)
31552836015389874262…48326783029699010561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.310 × 10⁹⁹(100-digit number)
63105672030779748525…96653566059398021121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.262 × 10¹⁰⁰(101-digit number)
12621134406155949705…93307132118796042241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.524 × 10¹⁰⁰(101-digit number)
25242268812311899410…86614264237592084481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.048 × 10¹⁰⁰(101-digit number)
50484537624623798820…73228528475184168961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.009 × 10¹⁰¹(102-digit number)
10096907524924759764…46457056950368337921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.019 × 10¹⁰¹(102-digit number)
20193815049849519528…92914113900736675841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.038 × 10¹⁰¹(102-digit number)
40387630099699039056…85828227801473351681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.077 × 10¹⁰¹(102-digit number)
80775260199398078112…71656455602946703361
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,733,302 XPM·at block #6,811,148 · 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