Block #2,130,576

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/24/2017, 12:41:33 PM · Difficulty 10.9097 · 4,707,087 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c5a0ad1e5dcd9d3b40b3ffde7baf9effa2d271f4f8f371ee5d068f94e38b22e3

Height

#2,130,576

Difficulty

10.909731

Transactions

2

Size

427 B

Version

2

Bits

0ae8e426

Nonce

42,324,812

Timestamp

5/24/2017, 12:41:33 PM

Confirmations

4,707,087

Merkle Root

3dace49ef556b50d3b50e73e1d8862e333191a24583865abddc837d162482301
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.

3.213 × 10⁹³(94-digit number)
32136292931696664699…90082792613488632061
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
3.213 × 10⁹³(94-digit number)
32136292931696664699…90082792613488632061
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.427 × 10⁹³(94-digit number)
64272585863393329399…80165585226977264121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.285 × 10⁹⁴(95-digit number)
12854517172678665879…60331170453954528241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.570 × 10⁹⁴(95-digit number)
25709034345357331759…20662340907909056481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.141 × 10⁹⁴(95-digit number)
51418068690714663519…41324681815818112961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.028 × 10⁹⁵(96-digit number)
10283613738142932703…82649363631636225921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.056 × 10⁹⁵(96-digit number)
20567227476285865407…65298727263272451841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.113 × 10⁹⁵(96-digit number)
41134454952571730815…30597454526544903681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.226 × 10⁹⁵(96-digit number)
82268909905143461631…61194909053089807361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.645 × 10⁹⁶(97-digit number)
16453781981028692326…22389818106179614721
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,945,627 XPM·at block #6,837,662 · 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