Block #329,745

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2013, 4:54:02 AM · Difficulty 10.1672 · 6,479,105 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0eec29bc059cd98657e9aa4be51194d7c3eb240a9546752b6f5f9f003775236c

Height

#329,745

Difficulty

10.167241

Transactions

19

Size

4.75 KB

Version

2

Bits

0a2ad050

Nonce

116,088

Timestamp

12/26/2013, 4:54:02 AM

Confirmations

6,479,105

Merkle Root

3deb4429c2d9886522053fde2794519c90d65f3844f3fa49dda1d87a2c581126
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.

2.699 × 10⁹⁴(95-digit number)
26994459322781972277…02020255128550073399
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
2.699 × 10⁹⁴(95-digit number)
26994459322781972277…02020255128550073399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.398 × 10⁹⁴(95-digit number)
53988918645563944554…04040510257100146799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.079 × 10⁹⁵(96-digit number)
10797783729112788910…08081020514200293599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.159 × 10⁹⁵(96-digit number)
21595567458225577821…16162041028400587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.319 × 10⁹⁵(96-digit number)
43191134916451155643…32324082056801174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.638 × 10⁹⁵(96-digit number)
86382269832902311287…64648164113602348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.727 × 10⁹⁶(97-digit number)
17276453966580462257…29296328227204697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.455 × 10⁹⁶(97-digit number)
34552907933160924514…58592656454409395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.910 × 10⁹⁶(97-digit number)
69105815866321849029…17185312908818790399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.382 × 10⁹⁷(98-digit number)
13821163173264369805…34370625817637580799
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,714,849 XPM·at block #6,808,849 · 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