Block #1,319,088

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/9/2015, 12:18:21 AM · Difficulty 10.8616 · 5,491,148 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
268a0b46b5d57c6bdffa3510453535caf7ebd67e8c616cbd703945d775fe7e9b

Height

#1,319,088

Difficulty

10.861555

Transactions

3

Size

1.32 KB

Version

2

Bits

0adc8ee1

Nonce

169,041,077

Timestamp

11/9/2015, 12:18:21 AM

Confirmations

5,491,148

Merkle Root

0de260254efc0bea3aa9e9c1192898ff12eb1ed0ee1892684d5d7d784f4ea386
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.575 × 10⁹³(94-digit number)
15758252590471744148…49319764807137770239
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.575 × 10⁹³(94-digit number)
15758252590471744148…49319764807137770239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.151 × 10⁹³(94-digit number)
31516505180943488296…98639529614275540479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.303 × 10⁹³(94-digit number)
63033010361886976593…97279059228551080959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.260 × 10⁹⁴(95-digit number)
12606602072377395318…94558118457102161919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.521 × 10⁹⁴(95-digit number)
25213204144754790637…89116236914204323839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.042 × 10⁹⁴(95-digit number)
50426408289509581275…78232473828408647679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.008 × 10⁹⁵(96-digit number)
10085281657901916255…56464947656817295359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.017 × 10⁹⁵(96-digit number)
20170563315803832510…12929895313634590719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.034 × 10⁹⁵(96-digit number)
40341126631607665020…25859790627269181439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.068 × 10⁹⁵(96-digit number)
80682253263215330040…51719581254538362879
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,725,965 XPM·at block #6,810,235 · 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.

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