Block #1,290,036

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/20/2015, 2:58:00 PM · Difficulty 10.8255 · 5,536,078 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a35d03fbb1090db088c984d9967fa10de1bc5f3524849038f88995761c1cc911

Height

#1,290,036

Difficulty

10.825499

Transactions

2

Size

427 B

Version

2

Bits

0ad353e2

Nonce

426,991,411

Timestamp

10/20/2015, 2:58:00 PM

Confirmations

5,536,078

Merkle Root

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

2.224 × 10⁹⁵(96-digit number)
22243033542767940775…44349425580451123199
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
2.224 × 10⁹⁵(96-digit number)
22243033542767940775…44349425580451123199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.448 × 10⁹⁵(96-digit number)
44486067085535881551…88698851160902246399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.897 × 10⁹⁵(96-digit number)
88972134171071763102…77397702321804492799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.779 × 10⁹⁶(97-digit number)
17794426834214352620…54795404643608985599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.558 × 10⁹⁶(97-digit number)
35588853668428705241…09590809287217971199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.117 × 10⁹⁶(97-digit number)
71177707336857410482…19181618574435942399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.423 × 10⁹⁷(98-digit number)
14235541467371482096…38363237148871884799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.847 × 10⁹⁷(98-digit number)
28471082934742964192…76726474297743769599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.694 × 10⁹⁷(98-digit number)
56942165869485928385…53452948595487539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.138 × 10⁹⁸(99-digit number)
11388433173897185677…06905897190975078399
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,853,037 XPM·at block #6,826,113 · 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