Block #2,135,741

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/28/2017, 12:36:02 PM · Difficulty 10.8987 · 4,704,714 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
caae3ec9533b26ee417b20fc8ff74f61aa1e04615825557c87e811b101d228d7

Height

#2,135,741

Difficulty

10.898748

Transactions

5

Size

3.79 KB

Version

2

Bits

0ae61456

Nonce

114,069,926

Timestamp

5/28/2017, 12:36:02 PM

Confirmations

4,704,714

Merkle Root

b9b3f18ce273199ac4086d10cff3c90af5af9acb551893c30cb441ca09e5eb52
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.209 × 10⁹²(93-digit number)
12090662346851051063…87340740124785662971
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.209 × 10⁹²(93-digit number)
12090662346851051063…87340740124785662971
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.418 × 10⁹²(93-digit number)
24181324693702102127…74681480249571325941
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.836 × 10⁹²(93-digit number)
48362649387404204255…49362960499142651881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.672 × 10⁹²(93-digit number)
96725298774808408510…98725920998285303761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.934 × 10⁹³(94-digit number)
19345059754961681702…97451841996570607521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.869 × 10⁹³(94-digit number)
38690119509923363404…94903683993141215041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.738 × 10⁹³(94-digit number)
77380239019846726808…89807367986282430081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.547 × 10⁹⁴(95-digit number)
15476047803969345361…79614735972564860161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.095 × 10⁹⁴(95-digit number)
30952095607938690723…59229471945129720321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.190 × 10⁹⁴(95-digit number)
61904191215877381447…18458943890259440641
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,967,971 XPM·at block #6,840,454 · 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