Block #336,280

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/30/2013, 8:28:31 PM · Difficulty 10.1438 · 6,490,856 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9db4ab0dd74f9173364e22c71328b4f0f000ed41a385d162a345407f567cb896

Height

#336,280

Difficulty

10.143818

Transactions

11

Size

2.40 KB

Version

2

Bits

0a24d143

Nonce

437,927

Timestamp

12/30/2013, 8:28:31 PM

Confirmations

6,490,856

Merkle Root

e21237632b86e63116903c5752fe33a5a3d735218d82851fa035080cfb787a81
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.932 × 10¹⁰¹(102-digit number)
29329871541978979528…23918182738289797119
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.932 × 10¹⁰¹(102-digit number)
29329871541978979528…23918182738289797119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.865 × 10¹⁰¹(102-digit number)
58659743083957959056…47836365476579594239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.173 × 10¹⁰²(103-digit number)
11731948616791591811…95672730953159188479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.346 × 10¹⁰²(103-digit number)
23463897233583183622…91345461906318376959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.692 × 10¹⁰²(103-digit number)
46927794467166367245…82690923812636753919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.385 × 10¹⁰²(103-digit number)
93855588934332734491…65381847625273507839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.877 × 10¹⁰³(104-digit number)
18771117786866546898…30763695250547015679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.754 × 10¹⁰³(104-digit number)
37542235573733093796…61527390501094031359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.508 × 10¹⁰³(104-digit number)
75084471147466187592…23054781002188062719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.501 × 10¹⁰⁴(105-digit number)
15016894229493237518…46109562004376125439
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,861,269 XPM·at block #6,827,135 · 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