Block #309,862

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2013, 7:19:22 PM · Difficulty 9.9950 · 6,498,313 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ebdb9b4df8b1917b91dc8e553132910b6cc5e81a0557d645fad4a6f530ffd1c7

Height

#309,862

Difficulty

9.994988

Transactions

7

Size

1.66 KB

Version

2

Bits

09feb78e

Nonce

189,968

Timestamp

12/13/2013, 7:19:22 PM

Confirmations

6,498,313

Merkle Root

434b320b5a380410e3b71f71d9231c55d493c33b0510c77215a65c81b3bed889
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.

2.566 × 10⁹⁵(96-digit number)
25665643749418558922…77037039021076514559
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
2.566 × 10⁹⁵(96-digit number)
25665643749418558922…77037039021076514559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.133 × 10⁹⁵(96-digit number)
51331287498837117844…54074078042153029119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.026 × 10⁹⁶(97-digit number)
10266257499767423568…08148156084306058239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.053 × 10⁹⁶(97-digit number)
20532514999534847137…16296312168612116479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.106 × 10⁹⁶(97-digit number)
41065029999069694275…32592624337224232959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.213 × 10⁹⁶(97-digit number)
82130059998139388551…65185248674448465919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.642 × 10⁹⁷(98-digit number)
16426011999627877710…30370497348896931839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.285 × 10⁹⁷(98-digit number)
32852023999255755420…60740994697793863679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.570 × 10⁹⁷(98-digit number)
65704047998511510841…21481989395587727359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.314 × 10⁹⁸(99-digit number)
13140809599702302168…42963978791175454719
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,709,448 XPM·at block #6,808,174 · 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