Block #2,643,880

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 6:37:43 AM · Difficulty 11.6962 · 4,189,673 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fb06b1bb0320964db044cd85a4a30fb6a74e189cd70442fae581cacfb93073ce

Height

#2,643,880

Difficulty

11.696193

Transactions

3

Size

619 B

Version

2

Bits

0bb239bb

Nonce

51,733,068

Timestamp

5/2/2018, 6:37:43 AM

Confirmations

4,189,673

Merkle Root

5fb0108c43f02d23280d2e9db188ab227b98e4d7279ba19a85b0dd00d9b46365
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.

1.467 × 10⁹⁶(97-digit number)
14679212813734865916…48722063182864531201
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
1.467 × 10⁹⁶(97-digit number)
14679212813734865916…48722063182864531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.935 × 10⁹⁶(97-digit number)
29358425627469731833…97444126365729062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.871 × 10⁹⁶(97-digit number)
58716851254939463667…94888252731458124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.174 × 10⁹⁷(98-digit number)
11743370250987892733…89776505462916249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.348 × 10⁹⁷(98-digit number)
23486740501975785467…79553010925832499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.697 × 10⁹⁷(98-digit number)
46973481003951570934…59106021851664998401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.394 × 10⁹⁷(98-digit number)
93946962007903141868…18212043703329996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.878 × 10⁹⁸(99-digit number)
18789392401580628373…36424087406659993601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.757 × 10⁹⁸(99-digit number)
37578784803161256747…72848174813319987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.515 × 10⁹⁸(99-digit number)
75157569606322513494…45696349626639974401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.503 × 10⁹⁹(100-digit number)
15031513921264502698…91392699253279948801
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,912,624 XPM·at block #6,833,552 · 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