Block #2,660,461

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/14/2018, 10:32:03 AM · Difficulty 11.6353 · 4,180,185 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
22909ba216180e1b18a645b798fd40997e55d19492ffee4c6eb0646c33cbabbb

Height

#2,660,461

Difficulty

11.635295

Transactions

5

Size

1.99 KB

Version

2

Bits

0ba2a2af

Nonce

256,327,568

Timestamp

5/14/2018, 10:32:03 AM

Confirmations

4,180,185

Merkle Root

50d9a3f3e2ac746cf6ad99f09a23a96f4aa11b923eacb0e8e70ac1281e96cd2b
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.

2.478 × 10⁹⁴(95-digit number)
24780008636663506530…85025211323197283161
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
2.478 × 10⁹⁴(95-digit number)
24780008636663506530…85025211323197283161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.956 × 10⁹⁴(95-digit number)
49560017273327013061…70050422646394566321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.912 × 10⁹⁴(95-digit number)
99120034546654026122…40100845292789132641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.982 × 10⁹⁵(96-digit number)
19824006909330805224…80201690585578265281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.964 × 10⁹⁵(96-digit number)
39648013818661610449…60403381171156530561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.929 × 10⁹⁵(96-digit number)
79296027637323220898…20806762342313061121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.585 × 10⁹⁶(97-digit number)
15859205527464644179…41613524684626122241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.171 × 10⁹⁶(97-digit number)
31718411054929288359…83227049369252244481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.343 × 10⁹⁶(97-digit number)
63436822109858576718…66454098738504488961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.268 × 10⁹⁷(98-digit number)
12687364421971715343…32908197477008977921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.537 × 10⁹⁷(98-digit number)
25374728843943430687…65816394954017955841
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,969,510 XPM·at block #6,840,645 · 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