Block #2,177,870

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/25/2017, 7:23:19 PM · Difficulty 10.9243 · 4,652,539 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
658d3eefe488e389d2c58575a005b5519ddc1f67047731475b559356aef9f397

Height

#2,177,870

Difficulty

10.924292

Transactions

7

Size

9.84 KB

Version

2

Bits

0aec9e61

Nonce

548,797,390

Timestamp

6/25/2017, 7:23:19 PM

Confirmations

4,652,539

Merkle Root

d6f9661fcd761a625ff381227c900c1c8bb243675a2e9bffc2bb173ae419b737
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.

5.013 × 10⁹⁶(97-digit number)
50131200359910029075…67920542601087641601
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
5.013 × 10⁹⁶(97-digit number)
50131200359910029075…67920542601087641601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.002 × 10⁹⁷(98-digit number)
10026240071982005815…35841085202175283201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.005 × 10⁹⁷(98-digit number)
20052480143964011630…71682170404350566401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.010 × 10⁹⁷(98-digit number)
40104960287928023260…43364340808701132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.020 × 10⁹⁷(98-digit number)
80209920575856046520…86728681617402265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.604 × 10⁹⁸(99-digit number)
16041984115171209304…73457363234804531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.208 × 10⁹⁸(99-digit number)
32083968230342418608…46914726469609062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.416 × 10⁹⁸(99-digit number)
64167936460684837216…93829452939218124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.283 × 10⁹⁹(100-digit number)
12833587292136967443…87658905878436249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.566 × 10⁹⁹(100-digit number)
25667174584273934886…75317811756872499201
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,887,512 XPM·at block #6,830,408 · 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