Block #328,489

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/25/2013, 8:11:14 AM · Difficulty 10.1647 · 6,479,772 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eaa727544986a3f9219e3ebd16db972ef295bd8cb1981c54ff1083d9e9419dd5

Height

#328,489

Difficulty

10.164655

Transactions

10

Size

7.06 KB

Version

2

Bits

0a2a26d7

Nonce

49,620

Timestamp

12/25/2013, 8:11:14 AM

Confirmations

6,479,772

Merkle Root

b875ace2b8b8ab51d5671590853b9ea0bde7a777daa4150c3091c4bf83a60192
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.953 × 10⁹⁶(97-digit number)
69537486378651653656…68421614465418414281
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.953 × 10⁹⁶(97-digit number)
69537486378651653656…68421614465418414281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.390 × 10⁹⁷(98-digit number)
13907497275730330731…36843228930836828561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.781 × 10⁹⁷(98-digit number)
27814994551460661462…73686457861673657121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.562 × 10⁹⁷(98-digit number)
55629989102921322925…47372915723347314241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.112 × 10⁹⁸(99-digit number)
11125997820584264585…94745831446694628481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.225 × 10⁹⁸(99-digit number)
22251995641168529170…89491662893389256961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.450 × 10⁹⁸(99-digit number)
44503991282337058340…78983325786778513921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.900 × 10⁹⁸(99-digit number)
89007982564674116680…57966651573557027841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.780 × 10⁹⁹(100-digit number)
17801596512934823336…15933303147114055681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.560 × 10⁹⁹(100-digit number)
35603193025869646672…31866606294228111361
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,710,135 XPM·at block #6,808,260 · 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