Block #338,763

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/1/2014, 3:45:35 PM · Difficulty 10.1245 · 6,488,532 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
869aba7cafea8f48e98d5ed913ce4326f81a1f8d100ab7fba08d6e8fa4439b01

Height

#338,763

Difficulty

10.124540

Transactions

5

Size

1.23 KB

Version

2

Bits

0a1fe1d9

Nonce

140,966

Timestamp

1/1/2014, 3:45:35 PM

Confirmations

6,488,532

Merkle Root

edfb3ee7af737a45970ed2c19576e3838482eaab91a4b709eafa53dda0b2aedd
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.641 × 10¹⁰¹(102-digit number)
66419418407714128188…58313019322232447679
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.641 × 10¹⁰¹(102-digit number)
66419418407714128188…58313019322232447679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.328 × 10¹⁰²(103-digit number)
13283883681542825637…16626038644464895359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.656 × 10¹⁰²(103-digit number)
26567767363085651275…33252077288929790719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.313 × 10¹⁰²(103-digit number)
53135534726171302550…66504154577859581439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.062 × 10¹⁰³(104-digit number)
10627106945234260510…33008309155719162879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.125 × 10¹⁰³(104-digit number)
21254213890468521020…66016618311438325759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.250 × 10¹⁰³(104-digit number)
42508427780937042040…32033236622876651519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.501 × 10¹⁰³(104-digit number)
85016855561874084081…64066473245753303039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.700 × 10¹⁰⁴(105-digit number)
17003371112374816816…28132946491506606079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.400 × 10¹⁰⁴(105-digit number)
34006742224749633632…56265892983013212159
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,470 XPM·at block #6,827,294 · 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