Block #295,297

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2013, 9:01:12 AM · Difficulty 9.9913 · 6,518,915 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4389013b7143b3485f3eb61da98d2d2aa4337656dbeb61196187d0b96611f002

Height

#295,297

Difficulty

9.991318

Transactions

13

Size

3.50 KB

Version

2

Bits

09fdc704

Nonce

49,486

Timestamp

12/5/2013, 9:01:12 AM

Confirmations

6,518,915

Merkle Root

15deab129119db7669e3bd716fe5e200cd051764e1015a42160714b3acb2a058
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)
36714479511101096866…99832977640269708799
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)
36714479511101096866…99832977640269708799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.342 × 10⁹⁶(97-digit number)
73428959022202193733…99665955280539417599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.468 × 10⁹⁷(98-digit number)
14685791804440438746…99331910561078835199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.937 × 10⁹⁷(98-digit number)
29371583608880877493…98663821122157670399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.874 × 10⁹⁷(98-digit number)
58743167217761754986…97327642244315340799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.174 × 10⁹⁸(99-digit number)
11748633443552350997…94655284488630681599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.349 × 10⁹⁸(99-digit number)
23497266887104701994…89310568977261363199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.699 × 10⁹⁸(99-digit number)
46994533774209403989…78621137954522726399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.398 × 10⁹⁸(99-digit number)
93989067548418807978…57242275909045452799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.879 × 10⁹⁹(100-digit number)
18797813509683761595…14484551818090905599
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,764 XPM·at block #6,814,211 · 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