Block #918,505

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/1/2015, 10:55:40 AM · Difficulty 10.9222 · 5,897,579 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8ca578c18117707ea563b9035fb30b8b003effaad91a7cdce57b418363a70ba1

Height

#918,505

Difficulty

10.922236

Transactions

7

Size

3.05 KB

Version

2

Bits

0aec17b0

Nonce

206,439,821

Timestamp

2/1/2015, 10:55:40 AM

Confirmations

5,897,579

Merkle Root

67747f94d6bf49d4db236d10014fa64b2a534d7d655980b2d7caf94e3b94f90c
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.247 × 10⁹⁸(99-digit number)
12475732649869669587…26175423072127662081
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.247 × 10⁹⁸(99-digit number)
12475732649869669587…26175423072127662081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.495 × 10⁹⁸(99-digit number)
24951465299739339175…52350846144255324161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.990 × 10⁹⁸(99-digit number)
49902930599478678350…04701692288510648321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.980 × 10⁹⁸(99-digit number)
99805861198957356701…09403384577021296641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.996 × 10⁹⁹(100-digit number)
19961172239791471340…18806769154042593281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.992 × 10⁹⁹(100-digit number)
39922344479582942680…37613538308085186561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.984 × 10⁹⁹(100-digit number)
79844688959165885361…75227076616170373121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.596 × 10¹⁰⁰(101-digit number)
15968937791833177072…50454153232340746241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.193 × 10¹⁰⁰(101-digit number)
31937875583666354144…00908306464681492481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.387 × 10¹⁰⁰(101-digit number)
63875751167332708289…01816612929362984961
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,772,790 XPM·at block #6,816,083 · 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