Block #2,287,065

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/8/2017, 12:16:55 AM · Difficulty 10.9554 · 4,554,792 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
01a57dedae7081a39dcdf74a1f4e7c2989ed2b76a47f9ef547e632478153698b

Height

#2,287,065

Difficulty

10.955420

Transactions

12

Size

5.54 KB

Version

2

Bits

0af4966e

Nonce

1,899,277,777

Timestamp

9/8/2017, 12:16:55 AM

Confirmations

4,554,792

Merkle Root

09aa5633aacf030ab3199cbe3ab92c618cfa23636cb87b21c347582fb1031454
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.874 × 10⁹⁴(95-digit number)
18746389612067954311…62094244216250231201
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.874 × 10⁹⁴(95-digit number)
18746389612067954311…62094244216250231201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.749 × 10⁹⁴(95-digit number)
37492779224135908623…24188488432500462401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.498 × 10⁹⁴(95-digit number)
74985558448271817247…48376976865000924801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.499 × 10⁹⁵(96-digit number)
14997111689654363449…96753953730001849601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.999 × 10⁹⁵(96-digit number)
29994223379308726898…93507907460003699201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.998 × 10⁹⁵(96-digit number)
59988446758617453797…87015814920007398401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.199 × 10⁹⁶(97-digit number)
11997689351723490759…74031629840014796801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.399 × 10⁹⁶(97-digit number)
23995378703446981519…48063259680029593601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.799 × 10⁹⁶(97-digit number)
47990757406893963038…96126519360059187201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.598 × 10⁹⁶(97-digit number)
95981514813787926076…92253038720118374401
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,979,232 XPM·at block #6,841,856 · 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