Block #2,654,885

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2018, 5:25:21 PM · Difficulty 11.7129 · 4,189,153 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a614ad10c41112e78fc64b0409b2ec44889f77e3ec2362e5f0c5ce415e224a98

Height

#2,654,885

Difficulty

11.712923

Transactions

9

Size

2.16 KB

Version

2

Bits

0bb68217

Nonce

1,704,067,554

Timestamp

5/9/2018, 5:25:21 PM

Confirmations

4,189,153

Merkle Root

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

3.284 × 10⁹⁶(97-digit number)
32846985009472876436…38486282028243873281
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
3.284 × 10⁹⁶(97-digit number)
32846985009472876436…38486282028243873281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.569 × 10⁹⁶(97-digit number)
65693970018945752872…76972564056487746561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.313 × 10⁹⁷(98-digit number)
13138794003789150574…53945128112975493121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.627 × 10⁹⁷(98-digit number)
26277588007578301148…07890256225950986241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.255 × 10⁹⁷(98-digit number)
52555176015156602297…15780512451901972481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.051 × 10⁹⁸(99-digit number)
10511035203031320459…31561024903803944961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.102 × 10⁹⁸(99-digit number)
21022070406062640919…63122049807607889921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.204 × 10⁹⁸(99-digit number)
42044140812125281838…26244099615215779841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.408 × 10⁹⁸(99-digit number)
84088281624250563676…52488199230431559681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.681 × 10⁹⁹(100-digit number)
16817656324850112735…04976398460863119361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.363 × 10⁹⁹(100-digit number)
33635312649700225470…09952796921726238721
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,996,682 XPM·at block #6,844,037 · 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