Block #334,315

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/29/2013, 10:10:24 AM · Difficulty 10.1579 · 6,474,950 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2e64a3464b1073d042dd6f13cbd54f990ce8cfd39486124b40dbabb9d7e9c779

Height

#334,315

Difficulty

10.157928

Transactions

1

Size

1005 B

Version

2

Bits

0a286df8

Nonce

96,576

Timestamp

12/29/2013, 10:10:24 AM

Confirmations

6,474,950

Merkle Root

174fedf52696c36231058837650d1ba1da66d2e63b39ec3d8387154cebb36e9b
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.

3.392 × 10⁹⁸(99-digit number)
33929991619370115193…89100282984024934399
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
3.392 × 10⁹⁸(99-digit number)
33929991619370115193…89100282984024934399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.785 × 10⁹⁸(99-digit number)
67859983238740230386…78200565968049868799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.357 × 10⁹⁹(100-digit number)
13571996647748046077…56401131936099737599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.714 × 10⁹⁹(100-digit number)
27143993295496092154…12802263872199475199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.428 × 10⁹⁹(100-digit number)
54287986590992184309…25604527744398950399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.085 × 10¹⁰⁰(101-digit number)
10857597318198436861…51209055488797900799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.171 × 10¹⁰⁰(101-digit number)
21715194636396873723…02418110977595801599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.343 × 10¹⁰⁰(101-digit number)
43430389272793747447…04836221955191603199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.686 × 10¹⁰⁰(101-digit number)
86860778545587494894…09672443910383206399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.737 × 10¹⁰¹(102-digit number)
17372155709117498978…19344887820766412799
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,718,188 XPM·at block #6,809,264 · 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