Block #2,180,306

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/27/2017, 3:33:24 AM · Difficulty 10.9316 · 4,646,579 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
296b37f0ccdef0f30456a4336b913b66fe54e1851294e8e3ddab06515e3cc48e

Height

#2,180,306

Difficulty

10.931587

Transactions

2

Size

609 B

Version

2

Bits

0aee7c79

Nonce

350,942,164

Timestamp

6/27/2017, 3:33:24 AM

Confirmations

4,646,579

Merkle Root

9ed8afd4196e3cd7c7829edb84cd5ffcddd9d7379d7e0c11862016aa05935f55
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.

6.556 × 10⁹⁴(95-digit number)
65564297824845465546…69896160741174273361
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
6.556 × 10⁹⁴(95-digit number)
65564297824845465546…69896160741174273361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.311 × 10⁹⁵(96-digit number)
13112859564969093109…39792321482348546721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.622 × 10⁹⁵(96-digit number)
26225719129938186218…79584642964697093441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.245 × 10⁹⁵(96-digit number)
52451438259876372436…59169285929394186881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.049 × 10⁹⁶(97-digit number)
10490287651975274487…18338571858788373761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.098 × 10⁹⁶(97-digit number)
20980575303950548974…36677143717576747521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.196 × 10⁹⁶(97-digit number)
41961150607901097949…73354287435153495041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.392 × 10⁹⁶(97-digit number)
83922301215802195899…46708574870306990081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.678 × 10⁹⁷(98-digit number)
16784460243160439179…93417149740613980161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.356 × 10⁹⁷(98-digit number)
33568920486320878359…86834299481227960321
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,859,245 XPM·at block #6,826,884 · 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