Block #1,459,943

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2016, 2:51:39 PM · Difficulty 10.7752 · 5,349,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
db5eaffe36ad3628fbac0c74b1b938f52e2a5293cc1fc6f332a824472b0c5498

Height

#1,459,943

Difficulty

10.775239

Transactions

3

Size

11.83 KB

Version

2

Bits

0ac67612

Nonce

456,040,711

Timestamp

2/16/2016, 2:51:39 PM

Confirmations

5,349,807

Merkle Root

150623b94dde53e91a0c971e7e30700c6ff978c060f8b37a1835d06af2689caa
Transactions (3)
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.

5.372 × 10⁹⁶(97-digit number)
53720010855602323319…92795063174768568319
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
5.372 × 10⁹⁶(97-digit number)
53720010855602323319…92795063174768568319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.074 × 10⁹⁷(98-digit number)
10744002171120464663…85590126349537136639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.148 × 10⁹⁷(98-digit number)
21488004342240929327…71180252699074273279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.297 × 10⁹⁷(98-digit number)
42976008684481858655…42360505398148546559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.595 × 10⁹⁷(98-digit number)
85952017368963717310…84721010796297093119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.719 × 10⁹⁸(99-digit number)
17190403473792743462…69442021592594186239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.438 × 10⁹⁸(99-digit number)
34380806947585486924…38884043185188372479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.876 × 10⁹⁸(99-digit number)
68761613895170973848…77768086370376744959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.375 × 10⁹⁹(100-digit number)
13752322779034194769…55536172740753489919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.750 × 10⁹⁹(100-digit number)
27504645558068389539…11072345481506979839
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,722,085 XPM·at block #6,809,749 · 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