Block #1,265,316

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/3/2015, 12:03:00 PM · Difficulty 10.8224 · 5,577,811 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eac80148f9238f4691a0653e5b854522a740776f5bbe9d82a37e8f0c385428a6

Height

#1,265,316

Difficulty

10.822404

Transactions

2

Size

773 B

Version

2

Bits

0ad2890e

Nonce

148,132,167

Timestamp

10/3/2015, 12:03:00 PM

Confirmations

5,577,811

Merkle Root

2c9c3cbb1e7a150cc7b6b53e84c340a25f07dd51cbee7be0af9863e3b4c62479
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.

9.370 × 10⁹⁷(98-digit number)
93705820669886128028…93542236552370201599
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
9.370 × 10⁹⁷(98-digit number)
93705820669886128028…93542236552370201599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.874 × 10⁹⁸(99-digit number)
18741164133977225605…87084473104740403199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.748 × 10⁹⁸(99-digit number)
37482328267954451211…74168946209480806399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.496 × 10⁹⁸(99-digit number)
74964656535908902422…48337892418961612799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.499 × 10⁹⁹(100-digit number)
14992931307181780484…96675784837923225599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.998 × 10⁹⁹(100-digit number)
29985862614363560969…93351569675846451199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.997 × 10⁹⁹(100-digit number)
59971725228727121938…86703139351692902399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.199 × 10¹⁰⁰(101-digit number)
11994345045745424387…73406278703385804799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.398 × 10¹⁰⁰(101-digit number)
23988690091490848775…46812557406771609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.797 × 10¹⁰⁰(101-digit number)
47977380182981697550…93625114813543219199
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,989,383 XPM·at block #6,843,126 · 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