Block #337,608

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/31/2013, 7:30:20 PM · Difficulty 10.1344 · 6,489,733 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fceb9bfd8f47a66833f91bd2f9d5277baa38c070fcd2040e6a7995266191b5c5

Height

#337,608

Difficulty

10.134364

Transactions

5

Size

1.37 KB

Version

2

Bits

0a2265ad

Nonce

39,793

Timestamp

12/31/2013, 7:30:20 PM

Confirmations

6,489,733

Merkle Root

8ed1aec3b2e2bd949e90e6f7e56e211ad9e61e1bd31c261a74c9fb4d0fce1fcb
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.

6.411 × 10⁹⁹(100-digit number)
64116706112989554201…82038576016804434879
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
6.411 × 10⁹⁹(100-digit number)
64116706112989554201…82038576016804434879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.282 × 10¹⁰⁰(101-digit number)
12823341222597910840…64077152033608869759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.564 × 10¹⁰⁰(101-digit number)
25646682445195821680…28154304067217739519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.129 × 10¹⁰⁰(101-digit number)
51293364890391643361…56308608134435479039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.025 × 10¹⁰¹(102-digit number)
10258672978078328672…12617216268870958079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.051 × 10¹⁰¹(102-digit number)
20517345956156657344…25234432537741916159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.103 × 10¹⁰¹(102-digit number)
41034691912313314688…50468865075483832319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.206 × 10¹⁰¹(102-digit number)
82069383824626629377…00937730150967664639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.641 × 10¹⁰²(103-digit number)
16413876764925325875…01875460301935329279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.282 × 10¹⁰²(103-digit number)
32827753529850651751…03750920603870658559
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,862,836 XPM·at block #6,827,340 · 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