Block #308,317

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2013, 1:22:01 AM · Difficulty 9.9945 · 6,516,334 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c9d3e30381f46b7bdf98bca24f25d074db296bdbec3218fdefb8af251c496008

Height

#308,317

Difficulty

9.994453

Transactions

4

Size

1.96 KB

Version

2

Bits

09fe9471

Nonce

15,388

Timestamp

12/13/2013, 1:22:01 AM

Confirmations

6,516,334

Merkle Root

1c1fd8799c84fb14e22b4aec625957bada2e926742cd1de2be848d40bcfe6d37
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.

8.658 × 10⁹⁵(96-digit number)
86581047311681235924…26825326078829527039
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
8.658 × 10⁹⁵(96-digit number)
86581047311681235924…26825326078829527039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.731 × 10⁹⁶(97-digit number)
17316209462336247184…53650652157659054079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.463 × 10⁹⁶(97-digit number)
34632418924672494369…07301304315318108159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.926 × 10⁹⁶(97-digit number)
69264837849344988739…14602608630636216319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.385 × 10⁹⁷(98-digit number)
13852967569868997747…29205217261272432639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.770 × 10⁹⁷(98-digit number)
27705935139737995495…58410434522544865279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.541 × 10⁹⁷(98-digit number)
55411870279475990991…16820869045089730559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.108 × 10⁹⁸(99-digit number)
11082374055895198198…33641738090179461119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.216 × 10⁹⁸(99-digit number)
22164748111790396396…67283476180358922239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.432 × 10⁹⁸(99-digit number)
44329496223580792793…34566952360717844479
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,841,273 XPM·at block #6,824,650 · 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