Block #335,011

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/29/2013, 9:33:49 PM · Difficulty 10.1609 · 6,479,006 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3683844df5041b40e87bd42f0309f36bcd8f8c6278721ae2b4fd2b9133dbb34d

Height

#335,011

Difficulty

10.160917

Transactions

15

Size

3.31 KB

Version

2

Bits

0a2931e3

Nonce

24,308

Timestamp

12/29/2013, 9:33:49 PM

Confirmations

6,479,006

Merkle Root

bc55e572794675eaedfddbf76436eea905fbe7cd3d4cf97f6fc1fabc2cbb57aa
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.323 × 10¹⁰⁰(101-digit number)
23239122117632267444…83298905588039056599
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.323 × 10¹⁰⁰(101-digit number)
23239122117632267444…83298905588039056599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.647 × 10¹⁰⁰(101-digit number)
46478244235264534889…66597811176078113199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.295 × 10¹⁰⁰(101-digit number)
92956488470529069779…33195622352156226399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.859 × 10¹⁰¹(102-digit number)
18591297694105813955…66391244704312452799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.718 × 10¹⁰¹(102-digit number)
37182595388211627911…32782489408624905599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.436 × 10¹⁰¹(102-digit number)
74365190776423255823…65564978817249811199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.487 × 10¹⁰²(103-digit number)
14873038155284651164…31129957634499622399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.974 × 10¹⁰²(103-digit number)
29746076310569302329…62259915268999244799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.949 × 10¹⁰²(103-digit number)
59492152621138604658…24519830537998489599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.189 × 10¹⁰³(104-digit number)
11898430524227720931…49039661075996979199
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,756,220 XPM·at block #6,814,016 · 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