Block #1,245,589

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/21/2015, 1:07:09 AM · Difficulty 10.7459 · 5,580,525 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
01d1a2502849b508507e12f8a4cd7bdefe00b18765bce3331b02eca922e156b9

Height

#1,245,589

Difficulty

10.745936

Transactions

4

Size

1.65 KB

Version

2

Bits

0abef5ae

Nonce

37,716,110

Timestamp

9/21/2015, 1:07:09 AM

Confirmations

5,580,525

Merkle Root

bd65169d582c87e0f1929c636492dcc5649edf94fd5afde81052b362fccff740
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.619 × 10⁹⁵(96-digit number)
16194834948766425610…73929308729388864639
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.619 × 10⁹⁵(96-digit number)
16194834948766425610…73929308729388864639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.238 × 10⁹⁵(96-digit number)
32389669897532851220…47858617458777729279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.477 × 10⁹⁵(96-digit number)
64779339795065702441…95717234917555458559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.295 × 10⁹⁶(97-digit number)
12955867959013140488…91434469835110917119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.591 × 10⁹⁶(97-digit number)
25911735918026280976…82868939670221834239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.182 × 10⁹⁶(97-digit number)
51823471836052561953…65737879340443668479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.036 × 10⁹⁷(98-digit number)
10364694367210512390…31475758680887336959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.072 × 10⁹⁷(98-digit number)
20729388734421024781…62951517361774673919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.145 × 10⁹⁷(98-digit number)
41458777468842049562…25903034723549347839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.291 × 10⁹⁷(98-digit number)
82917554937684099125…51806069447098695679
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