Block #2,815,557

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/29/2018, 4:38:51 PM · Difficulty 11.6843 · 4,023,615 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
73bc87943c4faed3865d73670fceda6ad02f2b7c6ed08099a7cf4e6403079b34

Height

#2,815,557

Difficulty

11.684347

Transactions

6

Size

2.59 KB

Version

2

Bits

0baf315b

Nonce

50,840,810

Timestamp

8/29/2018, 4:38:51 PM

Confirmations

4,023,615

Merkle Root

b52c4abd1b1575048e99b1d7a79db609c45804b4098e1984233172605909f6e5
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.757 × 10⁹⁷(98-digit number)
37573342447681128985…46604879194485370881
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.757 × 10⁹⁷(98-digit number)
37573342447681128985…46604879194485370881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.514 × 10⁹⁷(98-digit number)
75146684895362257970…93209758388970741761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.502 × 10⁹⁸(99-digit number)
15029336979072451594…86419516777941483521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.005 × 10⁹⁸(99-digit number)
30058673958144903188…72839033555882967041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.011 × 10⁹⁸(99-digit number)
60117347916289806376…45678067111765934081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.202 × 10⁹⁹(100-digit number)
12023469583257961275…91356134223531868161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.404 × 10⁹⁹(100-digit number)
24046939166515922550…82712268447063736321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.809 × 10⁹⁹(100-digit number)
48093878333031845101…65424536894127472641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.618 × 10⁹⁹(100-digit number)
96187756666063690202…30849073788254945281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.923 × 10¹⁰⁰(101-digit number)
19237551333212738040…61698147576509890561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.847 × 10¹⁰⁰(101-digit number)
38475102666425476080…23396295153019781121
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,957,657 XPM·at block #6,839,171 · 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