Block #338,426

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/1/2014, 10:33:31 AM · Difficulty 10.1201 · 6,475,807 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
51c3f1f2863ab328c542161e820b8a65cc5263b456b8271d42718b21109b73b9

Height

#338,426

Difficulty

10.120102

Transactions

8

Size

2.63 KB

Version

2

Bits

0a1ebef9

Nonce

184,774

Timestamp

1/1/2014, 10:33:31 AM

Confirmations

6,475,807

Merkle Root

915cfada2962f7f66c9dff1d3c99f6fcf5315c658a3c5472b6b2bece8e5791a7
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.

8.125 × 10⁸⁹(90-digit number)
81251995680756451383…50437517366772476159
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
8.125 × 10⁸⁹(90-digit number)
81251995680756451383…50437517366772476159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.625 × 10⁹⁰(91-digit number)
16250399136151290276…00875034733544952319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.250 × 10⁹⁰(91-digit number)
32500798272302580553…01750069467089904639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.500 × 10⁹⁰(91-digit number)
65001596544605161106…03500138934179809279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.300 × 10⁹¹(92-digit number)
13000319308921032221…07000277868359618559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.600 × 10⁹¹(92-digit number)
26000638617842064442…14000555736719237119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.200 × 10⁹¹(92-digit number)
52001277235684128885…28001111473438474239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.040 × 10⁹²(93-digit number)
10400255447136825777…56002222946876948479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.080 × 10⁹²(93-digit number)
20800510894273651554…12004445893753896959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.160 × 10⁹²(93-digit number)
41601021788547303108…24008891787507793919
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,757,935 XPM·at block #6,814,232 · 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