Block #2,191,339

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/3/2017, 4:34:01 PM · Difficulty 10.9506 · 4,635,812 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b1c6c5f4470c183f366baee756c4c2fbbcf27e3f508880c31e95f95c204e19ee

Height

#2,191,339

Difficulty

10.950624

Transactions

2

Size

573 B

Version

2

Bits

0af35c14

Nonce

1,392,176,807

Timestamp

7/3/2017, 4:34:01 PM

Confirmations

4,635,812

Merkle Root

0eaed9e5f5d9c1a356f326a3c24120b631246662a9002f1aec7a1f404b639d1a
Transactions (2)
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.

6.467 × 10⁹⁴(95-digit number)
64674674222872998999…05163034749271360321
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
6.467 × 10⁹⁴(95-digit number)
64674674222872998999…05163034749271360321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.293 × 10⁹⁵(96-digit number)
12934934844574599799…10326069498542720641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.586 × 10⁹⁵(96-digit number)
25869869689149199599…20652138997085441281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.173 × 10⁹⁵(96-digit number)
51739739378298399199…41304277994170882561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.034 × 10⁹⁶(97-digit number)
10347947875659679839…82608555988341765121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.069 × 10⁹⁶(97-digit number)
20695895751319359679…65217111976683530241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.139 × 10⁹⁶(97-digit number)
41391791502638719359…30434223953367060481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.278 × 10⁹⁶(97-digit number)
82783583005277438718…60868447906734120961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.655 × 10⁹⁷(98-digit number)
16556716601055487743…21736895813468241921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.311 × 10⁹⁷(98-digit number)
33113433202110975487…43473791626936483841
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,861,392 XPM·at block #6,827,150 · 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