Block #1,407,275

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2016, 12:04:02 PM · Difficulty 10.8058 · 5,435,851 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f0347e097c25d46f91e6f0624a959de619f6cb57b7f152cecc0952aa5c143ca7

Height

#1,407,275

Difficulty

10.805755

Transactions

3

Size

1.00 KB

Version

2

Bits

0ace45f9

Nonce

572,413,169

Timestamp

1/10/2016, 12:04:02 PM

Confirmations

5,435,851

Merkle Root

6c27ae2531697c8d48695620259ed264d20a4d59b392751081fdafa0009028fb
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.

7.145 × 10⁹⁵(96-digit number)
71453675189346963660…25878476929347971201
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
7.145 × 10⁹⁵(96-digit number)
71453675189346963660…25878476929347971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.429 × 10⁹⁶(97-digit number)
14290735037869392732…51756953858695942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.858 × 10⁹⁶(97-digit number)
28581470075738785464…03513907717391884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.716 × 10⁹⁶(97-digit number)
57162940151477570928…07027815434783769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.143 × 10⁹⁷(98-digit number)
11432588030295514185…14055630869567539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.286 × 10⁹⁷(98-digit number)
22865176060591028371…28111261739135078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.573 × 10⁹⁷(98-digit number)
45730352121182056742…56222523478270156801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.146 × 10⁹⁷(98-digit number)
91460704242364113485…12445046956540313601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.829 × 10⁹⁸(99-digit number)
18292140848472822697…24890093913080627201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.658 × 10⁹⁸(99-digit number)
36584281696945645394…49780187826161254401
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,989,374 XPM·at block #6,843,125 · 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