Block #323,273

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/21/2013, 1:10:14 PM · Difficulty 10.2035 · 6,483,868 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
73e827347b8e5ab43d3bb0355d357546282d53fd53766b8eda47382ec684ba2b

Height

#323,273

Difficulty

10.203533

Transactions

15

Size

3.87 KB

Version

2

Bits

0a341abf

Nonce

57,358

Timestamp

12/21/2013, 1:10:14 PM

Confirmations

6,483,868

Merkle Root

8f2136ea3c0ca56584a8806bdb0de2bc8a4faeda444bcafac6e6b8cce9c59e59
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.328 × 10¹⁰⁵(106-digit number)
13284952546840807430…78744128201487521649
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.328 × 10¹⁰⁵(106-digit number)
13284952546840807430…78744128201487521649
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.656 × 10¹⁰⁵(106-digit number)
26569905093681614860…57488256402975043299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.313 × 10¹⁰⁵(106-digit number)
53139810187363229721…14976512805950086599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.062 × 10¹⁰⁶(107-digit number)
10627962037472645944…29953025611900173199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.125 × 10¹⁰⁶(107-digit number)
21255924074945291888…59906051223800346399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.251 × 10¹⁰⁶(107-digit number)
42511848149890583777…19812102447600692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.502 × 10¹⁰⁶(107-digit number)
85023696299781167554…39624204895201385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.700 × 10¹⁰⁷(108-digit number)
17004739259956233510…79248409790402771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.400 × 10¹⁰⁷(108-digit number)
34009478519912467021…58496819580805542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.801 × 10¹⁰⁷(108-digit number)
68018957039824934043…16993639161611084799
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,701,135 XPM·at block #6,807,140 · 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