Block #339,607

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/2/2014, 5:52:09 AM · Difficulty 10.1246 · 6,503,037 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c9dbee72682738622e83432be2a2c199afe8119ea1a75dda1ba3dd95565c6230

Height

#339,607

Difficulty

10.124622

Transactions

2

Size

722 B

Version

2

Bits

0a1fe73e

Nonce

21,335

Timestamp

1/2/2014, 5:52:09 AM

Confirmations

6,503,037

Merkle Root

32c9bbb9b09a41052d979ba91f60aa269c457615479df7886e2544856ade1f1d
Transactions (2)
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.

3.671 × 10⁹⁶(97-digit number)
36715331994527968669…76164879481776365209
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
3.671 × 10⁹⁶(97-digit number)
36715331994527968669…76164879481776365209
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.343 × 10⁹⁶(97-digit number)
73430663989055937338…52329758963552730419
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.468 × 10⁹⁷(98-digit number)
14686132797811187467…04659517927105460839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.937 × 10⁹⁷(98-digit number)
29372265595622374935…09319035854210921679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.874 × 10⁹⁷(98-digit number)
58744531191244749871…18638071708421843359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.174 × 10⁹⁸(99-digit number)
11748906238248949974…37276143416843686719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.349 × 10⁹⁸(99-digit number)
23497812476497899948…74552286833687373439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.699 × 10⁹⁸(99-digit number)
46995624952995799896…49104573667374746879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.399 × 10⁹⁸(99-digit number)
93991249905991599793…98209147334749493759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.879 × 10⁹⁹(100-digit number)
18798249981198319958…96418294669498987519
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,985,586 XPM·at block #6,842,643 · 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