Block #295,317

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2013, 9:13:54 AM · Difficulty 9.9913 · 6,519,571 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
930cd34b980255f6bf68840ed7305c508247c7882b0ac21bfd91f3df20b66254

Height

#295,317

Difficulty

9.991331

Transactions

8

Size

2.03 KB

Version

2

Bits

09fdc7e2

Nonce

51,331

Timestamp

12/5/2013, 9:13:54 AM

Confirmations

6,519,571

Merkle Root

9c4aba5d7615a618c9afc5fdd34a3ca1fb67d99a22f95efda99af76920ad9641
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.228 × 10⁹⁶(97-digit number)
12282698231976070832…05080412396080303999
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.228 × 10⁹⁶(97-digit number)
12282698231976070832…05080412396080303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.456 × 10⁹⁶(97-digit number)
24565396463952141664…10160824792160607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.913 × 10⁹⁶(97-digit number)
49130792927904283329…20321649584321215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.826 × 10⁹⁶(97-digit number)
98261585855808566659…40643299168642431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.965 × 10⁹⁷(98-digit number)
19652317171161713331…81286598337284863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.930 × 10⁹⁷(98-digit number)
39304634342323426663…62573196674569727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.860 × 10⁹⁷(98-digit number)
78609268684646853327…25146393349139455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.572 × 10⁹⁸(99-digit number)
15721853736929370665…50292786698278911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.144 × 10⁹⁸(99-digit number)
31443707473858741330…00585573396557823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.288 × 10⁹⁸(99-digit number)
62887414947717482661…01171146793115647999
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,763,192 XPM·at block #6,814,887 · 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