Block #2,680,661

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/27/2018, 8:47:21 PM · Difficulty 11.6934 · 4,161,727 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
14b6b1fcb69583049ccb8c7fc79a262c5595230158fe53bf8dafb7f1565eb75f

Height

#2,680,661

Difficulty

11.693377

Transactions

40

Size

10.06 KB

Version

2

Bits

0bb1812f

Nonce

120,963,073

Timestamp

5/27/2018, 8:47:21 PM

Confirmations

4,161,727

Merkle Root

6b0ac40085c33c96108d1f988361f0733e9f23ff8221a0c070d74643200ea938
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.

4.075 × 10⁹⁴(95-digit number)
40756417138166344404…64187280054959093361
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
4.075 × 10⁹⁴(95-digit number)
40756417138166344404…64187280054959093361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.151 × 10⁹⁴(95-digit number)
81512834276332688809…28374560109918186721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.630 × 10⁹⁵(96-digit number)
16302566855266537761…56749120219836373441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.260 × 10⁹⁵(96-digit number)
32605133710533075523…13498240439672746881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.521 × 10⁹⁵(96-digit number)
65210267421066151047…26996480879345493761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.304 × 10⁹⁶(97-digit number)
13042053484213230209…53992961758690987521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.608 × 10⁹⁶(97-digit number)
26084106968426460419…07985923517381975041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.216 × 10⁹⁶(97-digit number)
52168213936852920838…15971847034763950081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.043 × 10⁹⁷(98-digit number)
10433642787370584167…31943694069527900161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.086 × 10⁹⁷(98-digit number)
20867285574741168335…63887388139055800321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.173 × 10⁹⁷(98-digit number)
41734571149482336670…27774776278111600641
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,983,514 XPM·at block #6,842,387 · 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