Block #321,099

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/20/2013, 2:38:13 AM · Difficulty 10.1865 · 6,505,897 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e59a188eb8e002c369f357777065990c7a7a53827c4e2acb466eab9588a41633

Height

#321,099

Difficulty

10.186531

Transactions

8

Size

2.59 KB

Version

2

Bits

0a2fc07a

Nonce

12,945

Timestamp

12/20/2013, 2:38:13 AM

Confirmations

6,505,897

Merkle Root

04478508590f56adc4143992cd5e06529200c9a019e61ff6108ed3e0710884b2
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.

9.853 × 10⁹⁶(97-digit number)
98537114959143794159…47459639359156455299
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
9.853 × 10⁹⁶(97-digit number)
98537114959143794159…47459639359156455299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.970 × 10⁹⁷(98-digit number)
19707422991828758831…94919278718312910599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.941 × 10⁹⁷(98-digit number)
39414845983657517663…89838557436625821199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.882 × 10⁹⁷(98-digit number)
78829691967315035327…79677114873251642399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.576 × 10⁹⁸(99-digit number)
15765938393463007065…59354229746503284799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.153 × 10⁹⁸(99-digit number)
31531876786926014131…18708459493006569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.306 × 10⁹⁸(99-digit number)
63063753573852028262…37416918986013139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.261 × 10⁹⁹(100-digit number)
12612750714770405652…74833837972026278399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.522 × 10⁹⁹(100-digit number)
25225501429540811304…49667675944052556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.045 × 10⁹⁹(100-digit number)
50451002859081622609…99335351888105113599
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,860,144 XPM·at block #6,826,995 · 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