Block #1,452,718

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/12/2016, 5:09:27 AM · Difficulty 10.7319 · 5,391,374 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
92fd3c2ffc226834a5b70e6a6989587eb3a06ca3c38361d3ab2ae2fe90e95fba

Height

#1,452,718

Difficulty

10.731901

Transactions

36

Size

12.38 KB

Version

2

Bits

0abb5dd7

Nonce

1,223,589,593

Timestamp

2/12/2016, 5:09:27 AM

Confirmations

5,391,374

Merkle Root

8cc0d074147ecb370050022a637f7f51bca6b63b391257b11b33de6346c415a7
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.

3.926 × 10⁹⁴(95-digit number)
39261726830097542341…02193324217383779881
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
3.926 × 10⁹⁴(95-digit number)
39261726830097542341…02193324217383779881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.852 × 10⁹⁴(95-digit number)
78523453660195084682…04386648434767559761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.570 × 10⁹⁵(96-digit number)
15704690732039016936…08773296869535119521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.140 × 10⁹⁵(96-digit number)
31409381464078033873…17546593739070239041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.281 × 10⁹⁵(96-digit number)
62818762928156067746…35093187478140478081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.256 × 10⁹⁶(97-digit number)
12563752585631213549…70186374956280956161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.512 × 10⁹⁶(97-digit number)
25127505171262427098…40372749912561912321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.025 × 10⁹⁶(97-digit number)
50255010342524854197…80745499825123824641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.005 × 10⁹⁷(98-digit number)
10051002068504970839…61490999650247649281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.010 × 10⁹⁷(98-digit number)
20102004137009941678…22981999300495298561
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,997,109 XPM·at block #6,844,091 · 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