Block #1,067,645

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/20/2015, 9:14:15 AM · Difficulty 10.7395 · 5,742,121 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1dcbe7df7c4291f798eca5d32bb240e59ed7f830a4b0bd6356d9b4578e95849a

Height

#1,067,645

Difficulty

10.739458

Transactions

15

Size

3.76 KB

Version

2

Bits

0abd4d22

Nonce

568,843,890

Timestamp

5/20/2015, 9:14:15 AM

Confirmations

5,742,121

Merkle Root

612ed83347eaec841ee2d8439983256c01ec2400790d1d1957490d4d8d69ab6f
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.

4.203 × 10⁹⁵(96-digit number)
42030911567145125545…22865418772382071601
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
4.203 × 10⁹⁵(96-digit number)
42030911567145125545…22865418772382071601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.406 × 10⁹⁵(96-digit number)
84061823134290251091…45730837544764143201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.681 × 10⁹⁶(97-digit number)
16812364626858050218…91461675089528286401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.362 × 10⁹⁶(97-digit number)
33624729253716100436…82923350179056572801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.724 × 10⁹⁶(97-digit number)
67249458507432200873…65846700358113145601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.344 × 10⁹⁷(98-digit number)
13449891701486440174…31693400716226291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.689 × 10⁹⁷(98-digit number)
26899783402972880349…63386801432452582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.379 × 10⁹⁷(98-digit number)
53799566805945760698…26773602864905164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.075 × 10⁹⁸(99-digit number)
10759913361189152139…53547205729810329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.151 × 10⁹⁸(99-digit number)
21519826722378304279…07094411459620659201
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,722,214 XPM·at block #6,809,765 · 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