Block #324,073

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/22/2013, 2:05:57 AM · Difficulty 10.2076 · 6,489,812 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cd9698baef5e77f614dff6870fabef912498832ae9fb4155de15872d5a0e9e8a

Height

#324,073

Difficulty

10.207573

Transactions

17

Size

4.36 KB

Version

2

Bits

0a352381

Nonce

203,551

Timestamp

12/22/2013, 2:05:57 AM

Confirmations

6,489,812

Merkle Root

8b6840685537c56bcbc7934a87a02fbdede6b5a60ae91187ecd34afe1a844bb9
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.

4.691 × 10⁹⁴(95-digit number)
46910540168290703266…50397792476134596639
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
4.691 × 10⁹⁴(95-digit number)
46910540168290703266…50397792476134596639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.382 × 10⁹⁴(95-digit number)
93821080336581406532…00795584952269193279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.876 × 10⁹⁵(96-digit number)
18764216067316281306…01591169904538386559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.752 × 10⁹⁵(96-digit number)
37528432134632562612…03182339809076773119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.505 × 10⁹⁵(96-digit number)
75056864269265125225…06364679618153546239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.501 × 10⁹⁶(97-digit number)
15011372853853025045…12729359236307092479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.002 × 10⁹⁶(97-digit number)
30022745707706050090…25458718472614184959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.004 × 10⁹⁶(97-digit number)
60045491415412100180…50917436945228369919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.200 × 10⁹⁷(98-digit number)
12009098283082420036…01834873890456739839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.401 × 10⁹⁷(98-digit number)
24018196566164840072…03669747780913479679
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,755,156 XPM·at block #6,813,884 · 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