Block #860,400

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/20/2014, 5:57:56 AM · Difficulty 10.9643 · 5,972,924 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d18e47875c4cbdadb83abe84db62c51f439661a9fcc47c10227b667d7a62543f

Height

#860,400

Difficulty

10.964254

Transactions

12

Size

2.92 KB

Version

2

Bits

0af6d961

Nonce

267,184,900

Timestamp

12/20/2014, 5:57:56 AM

Confirmations

5,972,924

Merkle Root

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

9.118 × 10⁹⁹(100-digit number)
91185232749925856663…41305066861951037441
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
9.118 × 10⁹⁹(100-digit number)
91185232749925856663…41305066861951037441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.823 × 10¹⁰⁰(101-digit number)
18237046549985171332…82610133723902074881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.647 × 10¹⁰⁰(101-digit number)
36474093099970342665…65220267447804149761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.294 × 10¹⁰⁰(101-digit number)
72948186199940685330…30440534895608299521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.458 × 10¹⁰¹(102-digit number)
14589637239988137066…60881069791216599041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.917 × 10¹⁰¹(102-digit number)
29179274479976274132…21762139582433198081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.835 × 10¹⁰¹(102-digit number)
58358548959952548264…43524279164866396161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.167 × 10¹⁰²(103-digit number)
11671709791990509652…87048558329732792321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.334 × 10¹⁰²(103-digit number)
23343419583981019305…74097116659465584641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.668 × 10¹⁰²(103-digit number)
46686839167962038611…48194233318931169281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.337 × 10¹⁰²(103-digit number)
93373678335924077223…96388466637862338561
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,785 XPM·at block #6,833,323 · 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