Block #428,262

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/3/2014, 10:57:58 PM · Difficulty 10.3492 · 6,386,169 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b07be425dd8cc23aa03a04b7bba7b9481986ac350a27463f560fb5167ee2a0ad

Height

#428,262

Difficulty

10.349242

Transactions

4

Size

6.66 KB

Version

2

Bits

0a5967f0

Nonce

54,259

Timestamp

3/3/2014, 10:57:58 PM

Confirmations

6,386,169

Merkle Root

09ac8df3a9dfa7529cc56368bd52a5c6be86fc59a89519f100d80a8d14040cbb
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.698 × 10⁹²(93-digit number)
16987834869940391971…05237041073471109879
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.698 × 10⁹²(93-digit number)
16987834869940391971…05237041073471109879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.397 × 10⁹²(93-digit number)
33975669739880783943…10474082146942219759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.795 × 10⁹²(93-digit number)
67951339479761567887…20948164293884439519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.359 × 10⁹³(94-digit number)
13590267895952313577…41896328587768879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.718 × 10⁹³(94-digit number)
27180535791904627155…83792657175537758079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.436 × 10⁹³(94-digit number)
54361071583809254310…67585314351075516159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.087 × 10⁹⁴(95-digit number)
10872214316761850862…35170628702151032319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.174 × 10⁹⁴(95-digit number)
21744428633523701724…70341257404302064639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.348 × 10⁹⁴(95-digit number)
43488857267047403448…40682514808604129279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.697 × 10⁹⁴(95-digit number)
86977714534094806896…81365029617208258559
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,759,515 XPM·at block #6,814,430 · 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