Block #885,734

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2015, 1:19:48 PM · Difficulty 10.9571 · 5,924,121 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fd7f4d6521e6922fce7bf85c6c8c115a272db2bdb172323ffed8a0b6bb461089

Height

#885,734

Difficulty

10.957062

Transactions

5

Size

1.66 KB

Version

2

Bits

0af5020c

Nonce

86,417,992

Timestamp

1/7/2015, 1:19:48 PM

Confirmations

5,924,121

Merkle Root

caa42e464d00a7a7f9ce8993c8dae7e9ee49115fceacbd0cc385a5fcd4440aff
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.003 × 10⁹⁶(97-digit number)
90030531858048506662…72690750219483586561
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.003 × 10⁹⁶(97-digit number)
90030531858048506662…72690750219483586561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.800 × 10⁹⁷(98-digit number)
18006106371609701332…45381500438967173121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.601 × 10⁹⁷(98-digit number)
36012212743219402665…90763000877934346241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.202 × 10⁹⁷(98-digit number)
72024425486438805330…81526001755868692481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.440 × 10⁹⁸(99-digit number)
14404885097287761066…63052003511737384961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.880 × 10⁹⁸(99-digit number)
28809770194575522132…26104007023474769921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.761 × 10⁹⁸(99-digit number)
57619540389151044264…52208014046949539841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.152 × 10⁹⁹(100-digit number)
11523908077830208852…04416028093899079681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.304 × 10⁹⁹(100-digit number)
23047816155660417705…08832056187798159361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.609 × 10⁹⁹(100-digit number)
46095632311320835411…17664112375596318721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.219 × 10⁹⁹(100-digit number)
92191264622641670822…35328224751192637441
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,722,927 XPM·at block #6,809,854 · 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.

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