Block #2,154,653

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/10/2017, 11:20:32 AM · Difficulty 10.9045 · 4,662,996 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e7f877820f7b5dece019cced4a818b0a2170b80fe48563deef0f628eb253b933

Height

#2,154,653

Difficulty

10.904456

Transactions

7

Size

3.84 KB

Version

2

Bits

0ae78a6b

Nonce

270,385,928

Timestamp

6/10/2017, 11:20:32 AM

Confirmations

4,662,996

Merkle Root

2321d240f5c705745c82c810301d1d7ec066dab089008bc556024248bd561973
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.

8.457 × 10⁹⁴(95-digit number)
84574567412496471066…58757834375690790761
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
8.457 × 10⁹⁴(95-digit number)
84574567412496471066…58757834375690790761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.691 × 10⁹⁵(96-digit number)
16914913482499294213…17515668751381581521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.382 × 10⁹⁵(96-digit number)
33829826964998588426…35031337502763163041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.765 × 10⁹⁵(96-digit number)
67659653929997176853…70062675005526326081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.353 × 10⁹⁶(97-digit number)
13531930785999435370…40125350011052652161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.706 × 10⁹⁶(97-digit number)
27063861571998870741…80250700022105304321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.412 × 10⁹⁶(97-digit number)
54127723143997741482…60501400044210608641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.082 × 10⁹⁷(98-digit number)
10825544628799548296…21002800088421217281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.165 × 10⁹⁷(98-digit number)
21651089257599096593…42005600176842434561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.330 × 10⁹⁷(98-digit number)
43302178515198193186…84011200353684869121
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,785,244 XPM·at block #6,817,648 · 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