Block #334,709

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/29/2013, 4:36:13 PM · Difficulty 10.1601 · 6,477,755 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
325ec8321457982f562551d2e8127f1cb7e813dc75f524ae0edc526b7e561298

Height

#334,709

Difficulty

10.160095

Transactions

9

Size

2.46 KB

Version

2

Bits

0a28fbf9

Nonce

121,492

Timestamp

12/29/2013, 4:36:13 PM

Confirmations

6,477,755

Merkle Root

be52c5669a5753f2920ece587c124b58ebcbc8a94fc7685f7c0b9fdbc15292fd
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.947 × 10⁹⁶(97-digit number)
59472167167207056156…74086527697721701999
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.947 × 10⁹⁶(97-digit number)
59472167167207056156…74086527697721701999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.189 × 10⁹⁷(98-digit number)
11894433433441411231…48173055395443403999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.378 × 10⁹⁷(98-digit number)
23788866866882822462…96346110790886807999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.757 × 10⁹⁷(98-digit number)
47577733733765644925…92692221581773615999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.515 × 10⁹⁷(98-digit number)
95155467467531289850…85384443163547231999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.903 × 10⁹⁸(99-digit number)
19031093493506257970…70768886327094463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.806 × 10⁹⁸(99-digit number)
38062186987012515940…41537772654188927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.612 × 10⁹⁸(99-digit number)
76124373974025031880…83075545308377855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.522 × 10⁹⁹(100-digit number)
15224874794805006376…66151090616755711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.044 × 10⁹⁹(100-digit number)
30449749589610012752…32302181233511423999
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,743,738 XPM·at block #6,812,463 · 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