Block #2,815,973

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/29/2018, 11:09:16 PM · Difficulty 11.6859 · 4,017,090 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3b416d712f654e48e53a894a28ad49ebb401ff2131a8002aea8ed2fc9026f53c

Height

#2,815,973

Difficulty

11.685936

Transactions

3

Size

1.32 KB

Version

2

Bits

0baf9988

Nonce

632,643,093

Timestamp

8/29/2018, 11:09:16 PM

Confirmations

4,017,090

Merkle Root

5b54634fb1f2af9e9d194aabf9607a3bb2817f321fde816cabdf56ffed1841e4
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.820 × 10⁹³(94-digit number)
38203364523783437889…43536677918615332181
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.820 × 10⁹³(94-digit number)
38203364523783437889…43536677918615332181
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.640 × 10⁹³(94-digit number)
76406729047566875779…87073355837230664361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.528 × 10⁹⁴(95-digit number)
15281345809513375155…74146711674461328721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.056 × 10⁹⁴(95-digit number)
30562691619026750311…48293423348922657441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.112 × 10⁹⁴(95-digit number)
61125383238053500623…96586846697845314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.222 × 10⁹⁵(96-digit number)
12225076647610700124…93173693395690629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.445 × 10⁹⁵(96-digit number)
24450153295221400249…86347386791381259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.890 × 10⁹⁵(96-digit number)
48900306590442800498…72694773582762519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.780 × 10⁹⁵(96-digit number)
97800613180885600997…45389547165525038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.956 × 10⁹⁶(97-digit number)
19560122636177120199…90779094331050076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.912 × 10⁹⁶(97-digit number)
39120245272354240398…81558188662100152321
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,908,677 XPM·at block #6,833,062 · 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