Block #1,345,144

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/28/2015, 1:40:31 AM · Difficulty 10.8188 · 5,497,807 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f59862e24b50b118f18c30908d2aa6b6858474cd4f501320d2a6d8e879893251

Height

#1,345,144

Difficulty

10.818755

Transactions

2

Size

3.30 KB

Version

2

Bits

0ad199ee

Nonce

1,547,690,733

Timestamp

11/28/2015, 1:40:31 AM

Confirmations

5,497,807

Merkle Root

15f5e03aeee04b658577c69aa3251de1a96550f6a4a23ce92163097cd2aa1122
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.

1.149 × 10⁹⁵(96-digit number)
11493775098060170069…22701830790902440839
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.149 × 10⁹⁵(96-digit number)
11493775098060170069…22701830790902440839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.298 × 10⁹⁵(96-digit number)
22987550196120340138…45403661581804881679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.597 × 10⁹⁵(96-digit number)
45975100392240680276…90807323163609763359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.195 × 10⁹⁵(96-digit number)
91950200784481360552…81614646327219526719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.839 × 10⁹⁶(97-digit number)
18390040156896272110…63229292654439053439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.678 × 10⁹⁶(97-digit number)
36780080313792544220…26458585308878106879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.356 × 10⁹⁶(97-digit number)
73560160627585088441…52917170617756213759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.471 × 10⁹⁷(98-digit number)
14712032125517017688…05834341235512427519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.942 × 10⁹⁷(98-digit number)
29424064251034035376…11668682471024855039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.884 × 10⁹⁷(98-digit number)
58848128502068070753…23337364942049710079
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,987,960 XPM·at block #6,842,950 · 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