Block #2,151,773

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/8/2017, 2:53:49 PM · Difficulty 10.9002 · 4,689,621 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
949bbd532ad61fe84e32cb28a0b39673793eb25e09ddef627742525a1f588883

Height

#2,151,773

Difficulty

10.900243

Transactions

2

Size

867 B

Version

2

Bits

0ae6765b

Nonce

1,557,326,720

Timestamp

6/8/2017, 2:53:49 PM

Confirmations

4,689,621

Merkle Root

58231c2c99927489c56c986510fce5665ea19f07e2ff52867d67ebfbe200b435
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.274 × 10⁹²(93-digit number)
72745004571396211711…12113820190695591121
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.274 × 10⁹²(93-digit number)
72745004571396211711…12113820190695591121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.454 × 10⁹³(94-digit number)
14549000914279242342…24227640381391182241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.909 × 10⁹³(94-digit number)
29098001828558484684…48455280762782364481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.819 × 10⁹³(94-digit number)
58196003657116969369…96910561525564728961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.163 × 10⁹⁴(95-digit number)
11639200731423393873…93821123051129457921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.327 × 10⁹⁴(95-digit number)
23278401462846787747…87642246102258915841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.655 × 10⁹⁴(95-digit number)
46556802925693575495…75284492204517831681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.311 × 10⁹⁴(95-digit number)
93113605851387150991…50568984409035663361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.862 × 10⁹⁵(96-digit number)
18622721170277430198…01137968818071326721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.724 × 10⁹⁵(96-digit number)
37245442340554860396…02275937636142653441
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,975,524 XPM·at block #6,841,393 · 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