Block #2,661,407

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2018, 2:45:03 AM · Difficulty 11.6336 · 4,169,890 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1171ad185cffb92ce194334d6347762bc35d254fc56f4ad7d38a2c4bfdfb7ddb

Height

#2,661,407

Difficulty

11.633564

Transactions

41

Size

9.76 KB

Version

2

Bits

0ba2313b

Nonce

170,236,683

Timestamp

5/15/2018, 2:45:03 AM

Confirmations

4,169,890

Merkle Root

a36e5ff693c89638f28da5383b4990233e0329677b17fb18d65187bb4b770c4f
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.736 × 10⁹⁵(96-digit number)
17366616430701273770…30900826710877242241
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.736 × 10⁹⁵(96-digit number)
17366616430701273770…30900826710877242241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.473 × 10⁹⁵(96-digit number)
34733232861402547540…61801653421754484481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.946 × 10⁹⁵(96-digit number)
69466465722805095081…23603306843508968961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.389 × 10⁹⁶(97-digit number)
13893293144561019016…47206613687017937921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.778 × 10⁹⁶(97-digit number)
27786586289122038032…94413227374035875841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.557 × 10⁹⁶(97-digit number)
55573172578244076065…88826454748071751681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.111 × 10⁹⁷(98-digit number)
11114634515648815213…77652909496143503361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.222 × 10⁹⁷(98-digit number)
22229269031297630426…55305818992287006721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.445 × 10⁹⁷(98-digit number)
44458538062595260852…10611637984574013441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.891 × 10⁹⁷(98-digit number)
88917076125190521704…21223275969148026881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.778 × 10⁹⁸(99-digit number)
17783415225038104340…42446551938296053761
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,894,523 XPM·at block #6,831,296 · 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