Block #336,778

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/31/2013, 5:02:40 AM · Difficulty 10.1409 · 6,474,200 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5d00be5f7c85bfb059ca5cfdd2780423a1e8a6411cdb3d472017b7b592866924

Height

#336,778

Difficulty

10.140942

Transactions

8

Size

2.89 KB

Version

2

Bits

0a2414be

Nonce

572,890

Timestamp

12/31/2013, 5:02:40 AM

Confirmations

6,474,200

Merkle Root

2ce8e5d31a6f478b8c3b2cc3cf01a2a2e19c23d0a244d80e1ad537aff0eff70e
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.

5.125 × 10¹⁰⁰(101-digit number)
51250548126626777653…60894421529800586239
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
5.125 × 10¹⁰⁰(101-digit number)
51250548126626777653…60894421529800586239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.025 × 10¹⁰¹(102-digit number)
10250109625325355530…21788843059601172479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.050 × 10¹⁰¹(102-digit number)
20500219250650711061…43577686119202344959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.100 × 10¹⁰¹(102-digit number)
41000438501301422122…87155372238404689919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.200 × 10¹⁰¹(102-digit number)
82000877002602844244…74310744476809379839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.640 × 10¹⁰²(103-digit number)
16400175400520568848…48621488953618759679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.280 × 10¹⁰²(103-digit number)
32800350801041137697…97242977907237519359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.560 × 10¹⁰²(103-digit number)
65600701602082275395…94485955814475038719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.312 × 10¹⁰³(104-digit number)
13120140320416455079…88971911628950077439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.624 × 10¹⁰³(104-digit number)
26240280640832910158…77943823257900154879
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,731,927 XPM·at block #6,810,977 · 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