Block #323,195

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/21/2013, 12:05:33 PM · Difficulty 10.2018 · 6,493,111 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b383193ed3de5a8566e403bcae7efcf7c87c5f5aae8768f129c6cc1a877f93f3

Height

#323,195

Difficulty

10.201760

Transactions

23

Size

6.03 KB

Version

2

Bits

0a33a68d

Nonce

308,250

Timestamp

12/21/2013, 12:05:33 PM

Confirmations

6,493,111

Merkle Root

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

6.613 × 10¹⁰⁰(101-digit number)
66135261415061483471…06970073539839514721
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
6.613 × 10¹⁰⁰(101-digit number)
66135261415061483471…06970073539839514721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.322 × 10¹⁰¹(102-digit number)
13227052283012296694…13940147079679029441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.645 × 10¹⁰¹(102-digit number)
26454104566024593388…27880294159358058881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.290 × 10¹⁰¹(102-digit number)
52908209132049186777…55760588318716117761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.058 × 10¹⁰²(103-digit number)
10581641826409837355…11521176637432235521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.116 × 10¹⁰²(103-digit number)
21163283652819674710…23042353274864471041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.232 × 10¹⁰²(103-digit number)
42326567305639349421…46084706549728942081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.465 × 10¹⁰²(103-digit number)
84653134611278698843…92169413099457884161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.693 × 10¹⁰³(104-digit number)
16930626922255739768…84338826198915768321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.386 × 10¹⁰³(104-digit number)
33861253844511479537…68677652397831536641
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,774,568 XPM·at block #6,816,305 · 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