Block #2,825,000

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/4/2018, 10:58:58 PM · Difficulty 11.7100 · 4,017,951 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5962777570d2d18c93ce6465561758b11427a9e08bb5e26632be2805125139dd

Height

#2,825,000

Difficulty

11.709997

Transactions

3

Size

1.41 KB

Version

2

Bits

0bb5c265

Nonce

1,861,546,621

Timestamp

9/4/2018, 10:58:58 PM

Confirmations

4,017,951

Merkle Root

1bffce9be7fdc7cd90df8369efce7105525d07bfdcdcf73aac325fcd2f9d1c95
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.431 × 10⁹²(93-digit number)
44314219152306206532…52440070236025586241
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.431 × 10⁹²(93-digit number)
44314219152306206532…52440070236025586241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.862 × 10⁹²(93-digit number)
88628438304612413064…04880140472051172481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.772 × 10⁹³(94-digit number)
17725687660922482612…09760280944102344961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.545 × 10⁹³(94-digit number)
35451375321844965225…19520561888204689921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.090 × 10⁹³(94-digit number)
70902750643689930451…39041123776409379841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.418 × 10⁹⁴(95-digit number)
14180550128737986090…78082247552818759681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.836 × 10⁹⁴(95-digit number)
28361100257475972180…56164495105637519361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.672 × 10⁹⁴(95-digit number)
56722200514951944361…12328990211275038721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.134 × 10⁹⁵(96-digit number)
11344440102990388872…24657980422550077441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.268 × 10⁹⁵(96-digit number)
22688880205980777744…49315960845100154881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.537 × 10⁹⁵(96-digit number)
45377760411961555489…98631921690200309761
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,987,960 XPM·at block #6,842,950 · 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