Block #323,684

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/21/2013, 7:42:04 PM · Difficulty 10.2068 · 6,493,212 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3905798bf7f61ffb5c0e88e45a73fdee831b4d6b192017f17d0317b6e577767f

Height

#323,684

Difficulty

10.206846

Transactions

19

Size

5.27 KB

Version

2

Bits

0a34f3db

Nonce

851,809

Timestamp

12/21/2013, 7:42:04 PM

Confirmations

6,493,212

Merkle Root

21132fe6916af00cf53a9b53aac7a736e6664d11eba5efba0c6ce7f2dd081977
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.656 × 10⁹⁶(97-digit number)
36568956303480861138…74439804693017566081
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.656 × 10⁹⁶(97-digit number)
36568956303480861138…74439804693017566081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.313 × 10⁹⁶(97-digit number)
73137912606961722277…48879609386035132161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.462 × 10⁹⁷(98-digit number)
14627582521392344455…97759218772070264321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.925 × 10⁹⁷(98-digit number)
29255165042784688911…95518437544140528641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.851 × 10⁹⁷(98-digit number)
58510330085569377822…91036875088281057281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.170 × 10⁹⁸(99-digit number)
11702066017113875564…82073750176562114561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.340 × 10⁹⁸(99-digit number)
23404132034227751128…64147500353124229121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.680 × 10⁹⁸(99-digit number)
46808264068455502257…28295000706248458241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.361 × 10⁹⁸(99-digit number)
93616528136911004515…56590001412496916481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.872 × 10⁹⁹(100-digit number)
18723305627382200903…13180002824993832961
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,779,210 XPM·at block #6,816,895 · 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