Block #326,385

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/23/2013, 6:41:59 PM · Difficulty 10.1880 · 6,499,301 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4de91d43309dddc360f01d4ec71a38b67458743f6ee5f6610ba4b2a6775dc707

Height

#326,385

Difficulty

10.188050

Transactions

1

Size

201 B

Version

2

Bits

0a30240a

Nonce

37,231

Timestamp

12/23/2013, 6:41:59 PM

Confirmations

6,499,301

Merkle Root

79d04508a43239d31cbd24e3e6477ecd329c99ab795db6ef48bd41a8845951c2
Transactions (1)
1 in → 1 out9.6200 XPM109 B
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.

1.516 × 10¹⁰⁰(101-digit number)
15161912491344409331…01243194948764805279
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
1.516 × 10¹⁰⁰(101-digit number)
15161912491344409331…01243194948764805279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.032 × 10¹⁰⁰(101-digit number)
30323824982688818663…02486389897529610559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.064 × 10¹⁰⁰(101-digit number)
60647649965377637327…04972779795059221119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.212 × 10¹⁰¹(102-digit number)
12129529993075527465…09945559590118442239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.425 × 10¹⁰¹(102-digit number)
24259059986151054930…19891119180236884479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.851 × 10¹⁰¹(102-digit number)
48518119972302109861…39782238360473768959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.703 × 10¹⁰¹(102-digit number)
97036239944604219723…79564476720947537919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.940 × 10¹⁰²(103-digit number)
19407247988920843944…59128953441895075839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.881 × 10¹⁰²(103-digit number)
38814495977841687889…18257906883790151679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.762 × 10¹⁰²(103-digit number)
77628991955683375778…36515813767580303359
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,849,598 XPM·at block #6,825,685 · 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