Block #2,679,346

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/26/2018, 10:51:40 PM · Difficulty 11.6936 · 4,157,761 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b124863acbee917b3046f45e4366c1c47335c6835bca9a03a5112280eff97c65

Height

#2,679,346

Difficulty

11.693609

Transactions

9

Size

2.55 KB

Version

2

Bits

0bb19064

Nonce

75,247,402

Timestamp

5/26/2018, 10:51:40 PM

Confirmations

4,157,761

Merkle Root

4cb4955506a562da96fe0d43ea0f0001ddffeaa8301cf78baa8ee0551cc27c4e
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.559 × 10⁹⁷(98-digit number)
15590026270049618934…94485493135453552641
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.559 × 10⁹⁷(98-digit number)
15590026270049618934…94485493135453552641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.118 × 10⁹⁷(98-digit number)
31180052540099237869…88970986270907105281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.236 × 10⁹⁷(98-digit number)
62360105080198475739…77941972541814210561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.247 × 10⁹⁸(99-digit number)
12472021016039695147…55883945083628421121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.494 × 10⁹⁸(99-digit number)
24944042032079390295…11767890167256842241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.988 × 10⁹⁸(99-digit number)
49888084064158780591…23535780334513684481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.977 × 10⁹⁸(99-digit number)
99776168128317561182…47071560669027368961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.995 × 10⁹⁹(100-digit number)
19955233625663512236…94143121338054737921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.991 × 10⁹⁹(100-digit number)
39910467251327024473…88286242676109475841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.982 × 10⁹⁹(100-digit number)
79820934502654048946…76572485352218951681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.596 × 10¹⁰⁰(101-digit number)
15964186900530809789…53144970704437903361
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,941,165 XPM·at block #6,837,106 · 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