Block #2,177,841

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/25/2017, 7:05:16 PM · Difficulty 10.9241 · 4,664,471 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
89a23d2d468500767b01046d84eb9f95eec708c5a677a27c386b9f48008c2692

Height

#2,177,841

Difficulty

10.924131

Transactions

5

Size

1.08 KB

Version

2

Bits

0aec93d7

Nonce

1,296,729,330

Timestamp

6/25/2017, 7:05:16 PM

Confirmations

4,664,471

Merkle Root

01f95de0d9eb09dcd14aa3135bcd7a3664c7daddc5234ed5202bbd011e85f383
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.638 × 10⁹⁵(96-digit number)
16386788719151717548…65038448754178878281
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.638 × 10⁹⁵(96-digit number)
16386788719151717548…65038448754178878281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.277 × 10⁹⁵(96-digit number)
32773577438303435096…30076897508357756561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.554 × 10⁹⁵(96-digit number)
65547154876606870192…60153795016715513121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.310 × 10⁹⁶(97-digit number)
13109430975321374038…20307590033431026241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.621 × 10⁹⁶(97-digit number)
26218861950642748076…40615180066862052481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.243 × 10⁹⁶(97-digit number)
52437723901285496153…81230360133724104961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.048 × 10⁹⁷(98-digit number)
10487544780257099230…62460720267448209921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.097 × 10⁹⁷(98-digit number)
20975089560514198461…24921440534896419841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.195 × 10⁹⁷(98-digit number)
41950179121028396922…49842881069792839681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.390 × 10⁹⁷(98-digit number)
83900358242056793845…99685762139585679361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.678 × 10⁹⁸(99-digit number)
16780071648411358769…99371524279171358721
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,982,903 XPM·at block #6,842,311 · 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