Block #338,099

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/1/2014, 5:01:15 AM · Difficulty 10.1213 · 6,472,158 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a320e53aca2bac8b0cb4c569cb40a10036f5cacf79ea59adcefd62a32035f198

Height

#338,099

Difficulty

10.121258

Transactions

25

Size

5.78 KB

Version

2

Bits

0a1f0ac4

Nonce

73,228

Timestamp

1/1/2014, 5:01:15 AM

Confirmations

6,472,158

Merkle Root

34716e44063d52afc1c4b12fd53ce1478a0581bb3e14c6234520a271ec7bddf9
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.

1.591 × 10⁹⁹(100-digit number)
15912284846902905611…83423817157506012159
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
1.591 × 10⁹⁹(100-digit number)
15912284846902905611…83423817157506012159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.182 × 10⁹⁹(100-digit number)
31824569693805811223…66847634315012024319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.364 × 10⁹⁹(100-digit number)
63649139387611622446…33695268630024048639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.272 × 10¹⁰⁰(101-digit number)
12729827877522324489…67390537260048097279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.545 × 10¹⁰⁰(101-digit number)
25459655755044648978…34781074520096194559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.091 × 10¹⁰⁰(101-digit number)
50919311510089297957…69562149040192389119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.018 × 10¹⁰¹(102-digit number)
10183862302017859591…39124298080384778239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.036 × 10¹⁰¹(102-digit number)
20367724604035719182…78248596160769556479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.073 × 10¹⁰¹(102-digit number)
40735449208071438365…56497192321539112959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.147 × 10¹⁰¹(102-digit number)
81470898416142876731…12994384643078225919
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,726,129 XPM·at block #6,810,256 · 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