Block #2,924,830

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/16/2018, 2:31:59 AM · Difficulty 11.3573 · 3,908,202 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
24cf3b51a319579c7395c611ff9103d59ba612ae2d67e6cfcb44476d32135fb9

Height

#2,924,830

Difficulty

11.357349

Transactions

15

Size

67.74 KB

Version

2

Bits

0b5b7b39

Nonce

682,324,524

Timestamp

11/16/2018, 2:31:59 AM

Confirmations

3,908,202

Merkle Root

266c1aefa79b3d73e28a8f87d5b312255b41e3ff5d35fab737ee85e7127da9ae
Transactions (15)
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.

2.020 × 10⁹⁵(96-digit number)
20200963353619543212…79486831843123305601
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
2.020 × 10⁹⁵(96-digit number)
20200963353619543212…79486831843123305601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.040 × 10⁹⁵(96-digit number)
40401926707239086425…58973663686246611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.080 × 10⁹⁵(96-digit number)
80803853414478172851…17947327372493222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.616 × 10⁹⁶(97-digit number)
16160770682895634570…35894654744986444801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.232 × 10⁹⁶(97-digit number)
32321541365791269140…71789309489972889601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.464 × 10⁹⁶(97-digit number)
64643082731582538281…43578618979945779201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.292 × 10⁹⁷(98-digit number)
12928616546316507656…87157237959891558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.585 × 10⁹⁷(98-digit number)
25857233092633015312…74314475919783116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.171 × 10⁹⁷(98-digit number)
51714466185266030624…48628951839566233601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.034 × 10⁹⁸(99-digit number)
10342893237053206124…97257903679132467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.068 × 10⁹⁸(99-digit number)
20685786474106412249…94515807358264934401
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,433 XPM·at block #6,833,031 · 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