Block #2,093,968

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2017, 7:37:02 AM · Difficulty 10.8710 · 4,744,027 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1f3131ad70512a1f44ebfd22df0927d40f7d7921f5b12bc3607cdaae9395a31f

Height

#2,093,968

Difficulty

10.871010

Transactions

2

Size

1017 B

Version

2

Bits

0adefa88

Nonce

395,901,040

Timestamp

4/30/2017, 7:37:02 AM

Confirmations

4,744,027

Merkle Root

44e2dd55a4bb3f448e9c822a74deaa09550d80ab958a2996f1fc72e6faa2d802
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.

7.164 × 10⁹³(94-digit number)
71640993613419722132…46070850486768825391
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.164 × 10⁹³(94-digit number)
71640993613419722132…46070850486768825391
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.432 × 10⁹⁴(95-digit number)
14328198722683944426…92141700973537650781
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.865 × 10⁹⁴(95-digit number)
28656397445367888853…84283401947075301561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.731 × 10⁹⁴(95-digit number)
57312794890735777706…68566803894150603121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.146 × 10⁹⁵(96-digit number)
11462558978147155541…37133607788301206241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.292 × 10⁹⁵(96-digit number)
22925117956294311082…74267215576602412481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.585 × 10⁹⁵(96-digit number)
45850235912588622164…48534431153204824961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.170 × 10⁹⁵(96-digit number)
91700471825177244329…97068862306409649921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.834 × 10⁹⁶(97-digit number)
18340094365035448865…94137724612819299841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.668 × 10⁹⁶(97-digit number)
36680188730070897731…88275449225638599681
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,948,311 XPM·at block #6,837,994 · 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