Block #2,137,765

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/30/2017, 7:54:25 AM · Difficulty 10.8866 · 4,703,262 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4c27bc71df4c04111e4d1c4eb2db0a6f90130b76f01b94cbad98223e0937c786

Height

#2,137,765

Difficulty

10.886555

Transactions

3

Size

652 B

Version

2

Bits

0ae2f545

Nonce

37,367,723

Timestamp

5/30/2017, 7:54:25 AM

Confirmations

4,703,262

Merkle Root

61b17d5a7bdbc42146939fa4a458589366c9678d236972b5bba8f696cd8730d3
Transactions (3)
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.

9.634 × 10⁹³(94-digit number)
96343632585697643310…25016445629888599921
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
9.634 × 10⁹³(94-digit number)
96343632585697643310…25016445629888599921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.926 × 10⁹⁴(95-digit number)
19268726517139528662…50032891259777199841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.853 × 10⁹⁴(95-digit number)
38537453034279057324…00065782519554399681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.707 × 10⁹⁴(95-digit number)
77074906068558114648…00131565039108799361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.541 × 10⁹⁵(96-digit number)
15414981213711622929…00263130078217598721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.082 × 10⁹⁵(96-digit number)
30829962427423245859…00526260156435197441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.165 × 10⁹⁵(96-digit number)
61659924854846491718…01052520312870394881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.233 × 10⁹⁶(97-digit number)
12331984970969298343…02105040625740789761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.466 × 10⁹⁶(97-digit number)
24663969941938596687…04210081251481579521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.932 × 10⁹⁶(97-digit number)
49327939883877193375…08420162502963159041
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,972,574 XPM·at block #6,841,026 · 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