Block #334,896

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/29/2013, 7:46:24 PM · Difficulty 10.1594 · 6,479,404 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
587195be1d7bfd5e60ef46e811f9aa6e0ab92f82675ee5e6db6468b66969dcfe

Height

#334,896

Difficulty

10.159428

Transactions

9

Size

2.67 KB

Version

2

Bits

0a28d04b

Nonce

136,051

Timestamp

12/29/2013, 7:46:24 PM

Confirmations

6,479,404

Merkle Root

bbe3e493ce2da9a852b16d2734d3133c78fa284696f55e56e83a53dc56678b88
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.240 × 10¹⁰²(103-digit number)
22403994694543867252…70293086977866132479
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.240 × 10¹⁰²(103-digit number)
22403994694543867252…70293086977866132479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.480 × 10¹⁰²(103-digit number)
44807989389087734505…40586173955732264959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.961 × 10¹⁰²(103-digit number)
89615978778175469010…81172347911464529919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.792 × 10¹⁰³(104-digit number)
17923195755635093802…62344695822929059839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.584 × 10¹⁰³(104-digit number)
35846391511270187604…24689391645858119679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.169 × 10¹⁰³(104-digit number)
71692783022540375208…49378783291716239359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.433 × 10¹⁰⁴(105-digit number)
14338556604508075041…98757566583432478719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.867 × 10¹⁰⁴(105-digit number)
28677113209016150083…97515133166864957439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.735 × 10¹⁰⁴(105-digit number)
57354226418032300166…95030266333729914879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.147 × 10¹⁰⁵(106-digit number)
11470845283606460033…90060532667459829759
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,758,464 XPM·at block #6,814,299 · 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