Block #2,924,326

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/15/2018, 5:44:25 PM · Difficulty 11.3605 · 3,917,225 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7beaf65b34dcf523c6d4a6a21900f178d322567cd3821d1caf67c2b16ef70880

Height

#2,924,326

Difficulty

11.360529

Transactions

35

Size

10.85 KB

Version

2

Bits

0b5c4b9e

Nonce

1,416,148,573

Timestamp

11/15/2018, 5:44:25 PM

Confirmations

3,917,225

Merkle Root

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

6.540 × 10⁹²(93-digit number)
65403359109946964524…60380335637217459441
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
6.540 × 10⁹²(93-digit number)
65403359109946964524…60380335637217459441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.308 × 10⁹³(94-digit number)
13080671821989392904…20760671274434918881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.616 × 10⁹³(94-digit number)
26161343643978785809…41521342548869837761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.232 × 10⁹³(94-digit number)
52322687287957571619…83042685097739675521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.046 × 10⁹⁴(95-digit number)
10464537457591514323…66085370195479351041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.092 × 10⁹⁴(95-digit number)
20929074915183028647…32170740390958702081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.185 × 10⁹⁴(95-digit number)
41858149830366057295…64341480781917404161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.371 × 10⁹⁴(95-digit number)
83716299660732114590…28682961563834808321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.674 × 10⁹⁵(96-digit number)
16743259932146422918…57365923127669616641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.348 × 10⁹⁵(96-digit number)
33486519864292845836…14731846255339233281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.697 × 10⁹⁵(96-digit number)
66973039728585691672…29463692510678466561
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,976,792 XPM·at block #6,841,550 · 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