Block #1,359,293

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/7/2015, 12:36:49 PM · Difficulty 10.8374 · 5,466,008 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
01b34e0212f53fe9d30055d49f043b05995a7ce4cf60b3c887840ced58da8458

Height

#1,359,293

Difficulty

10.837438

Transactions

3

Size

4.39 KB

Version

2

Bits

0ad66259

Nonce

156,300,496

Timestamp

12/7/2015, 12:36:49 PM

Confirmations

5,466,008

Merkle Root

4887afe35ea9090cdbbf5e1a1665ab2ea1f33cd1adfa423bea6b094877adedcd
Transactions (3)
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.845 × 10⁹⁴(95-digit number)
88453031281185429609…55583407316932224319
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.845 × 10⁹⁴(95-digit number)
88453031281185429609…55583407316932224319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.769 × 10⁹⁵(96-digit number)
17690606256237085921…11166814633864448639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.538 × 10⁹⁵(96-digit number)
35381212512474171843…22333629267728897279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.076 × 10⁹⁵(96-digit number)
70762425024948343687…44667258535457794559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.415 × 10⁹⁶(97-digit number)
14152485004989668737…89334517070915589119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.830 × 10⁹⁶(97-digit number)
28304970009979337475…78669034141831178239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.660 × 10⁹⁶(97-digit number)
56609940019958674950…57338068283662356479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.132 × 10⁹⁷(98-digit number)
11321988003991734990…14676136567324712959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.264 × 10⁹⁷(98-digit number)
22643976007983469980…29352273134649425919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.528 × 10⁹⁷(98-digit number)
45287952015966939960…58704546269298851839
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,846,509 XPM·at block #6,825,300 · 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