Block #1,267,990

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/5/2015, 10:18:18 AM · Difficulty 10.8189 · 5,549,375 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
da789b18a9092be4b5a5a600e45362028bb3689764fc6ccdb3fadc7f7e9dd203

Height

#1,267,990

Difficulty

10.818897

Transactions

2

Size

1.43 KB

Version

2

Bits

0ad1a33e

Nonce

36,722,141

Timestamp

10/5/2015, 10:18:18 AM

Confirmations

5,549,375

Merkle Root

dde7fdf5b313bc593f818eaa0afcc6668ce823e792b7abffe77caf4478a090cd
Transactions (2)
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.

6.336 × 10⁹⁴(95-digit number)
63365809917547825246…60822760850518798079
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
6.336 × 10⁹⁴(95-digit number)
63365809917547825246…60822760850518798079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.267 × 10⁹⁵(96-digit number)
12673161983509565049…21645521701037596159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.534 × 10⁹⁵(96-digit number)
25346323967019130098…43291043402075192319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.069 × 10⁹⁵(96-digit number)
50692647934038260196…86582086804150384639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.013 × 10⁹⁶(97-digit number)
10138529586807652039…73164173608300769279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.027 × 10⁹⁶(97-digit number)
20277059173615304078…46328347216601538559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.055 × 10⁹⁶(97-digit number)
40554118347230608157…92656694433203077119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.110 × 10⁹⁶(97-digit number)
81108236694461216315…85313388866406154239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.622 × 10⁹⁷(98-digit number)
16221647338892243263…70626777732812308479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.244 × 10⁹⁷(98-digit number)
32443294677784486526…41253555465624616959
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,782,960 XPM·at block #6,817,364 · 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