Block #336,830

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/31/2013, 5:59:27 AM · Difficulty 10.1400 · 6,473,884 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
caac597043f2fc3ce28086b30284d3ced57cc5c5ecac41bc965b921fd31d7fc0

Height

#336,830

Difficulty

10.139992

Transactions

4

Size

868 B

Version

2

Bits

0a23d683

Nonce

23,058

Timestamp

12/31/2013, 5:59:27 AM

Confirmations

6,473,884

Merkle Root

60c960b6f717fa10346e1674b5c8b3fc92bcdbf1ebd4832e7fee6b7a49a182b4
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.

8.175 × 10¹⁰¹(102-digit number)
81750265532490619964…42656070082886555119
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
8.175 × 10¹⁰¹(102-digit number)
81750265532490619964…42656070082886555119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.635 × 10¹⁰²(103-digit number)
16350053106498123992…85312140165773110239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.270 × 10¹⁰²(103-digit number)
32700106212996247985…70624280331546220479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.540 × 10¹⁰²(103-digit number)
65400212425992495971…41248560663092440959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.308 × 10¹⁰³(104-digit number)
13080042485198499194…82497121326184881919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.616 × 10¹⁰³(104-digit number)
26160084970396998388…64994242652369763839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.232 × 10¹⁰³(104-digit number)
52320169940793996776…29988485304739527679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.046 × 10¹⁰⁴(105-digit number)
10464033988158799355…59976970609479055359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.092 × 10¹⁰⁴(105-digit number)
20928067976317598710…19953941218958110719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.185 × 10¹⁰⁴(105-digit number)
41856135952635197421…39907882437916221439
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,729,799 XPM·at block #6,810,713 · 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