Block #2,546,330

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/3/2018, 2:05:17 AM · Difficulty 10.9881 · 4,287,004 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fb5bc93a09314b6452e4cf6fd51f77c7f7c6d7e43b02a63de2a1742122bb84fa

Height

#2,546,330

Difficulty

10.988082

Transactions

4

Size

959 B

Version

2

Bits

0afcf2eb

Nonce

1,096,379,312

Timestamp

3/3/2018, 2:05:17 AM

Confirmations

4,287,004

Merkle Root

3547f5cfad18bcb1cf72aeec1a06952a0174a3bd90db34c5fa95eff3c3e381ab
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.061 × 10⁹⁴(95-digit number)
10615382252220053437…94114488003206141871
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.061 × 10⁹⁴(95-digit number)
10615382252220053437…94114488003206141871
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.123 × 10⁹⁴(95-digit number)
21230764504440106875…88228976006412283741
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.246 × 10⁹⁴(95-digit number)
42461529008880213750…76457952012824567481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.492 × 10⁹⁴(95-digit number)
84923058017760427500…52915904025649134961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.698 × 10⁹⁵(96-digit number)
16984611603552085500…05831808051298269921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.396 × 10⁹⁵(96-digit number)
33969223207104171000…11663616102596539841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.793 × 10⁹⁵(96-digit number)
67938446414208342000…23327232205193079681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.358 × 10⁹⁶(97-digit number)
13587689282841668400…46654464410386159361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.717 × 10⁹⁶(97-digit number)
27175378565683336800…93308928820772318721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.435 × 10⁹⁶(97-digit number)
54350757131366673600…86617857641544637441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.087 × 10⁹⁷(98-digit number)
10870151426273334720…73235715283089274881
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,910,867 XPM·at block #6,833,333 · 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