Block #850,897

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2014, 9:18:53 PM · Difficulty 10.9710 · 5,992,318 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7c0900ff63e7fda17bb1a726814573e372215071bf59cc0cce47f07f06be02fd

Height

#850,897

Difficulty

10.971003

Transactions

4

Size

884 B

Version

2

Bits

0af893a4

Nonce

1,119,173,158

Timestamp

12/12/2014, 9:18:53 PM

Confirmations

5,992,318

Merkle Root

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

8.193 × 10⁹⁴(95-digit number)
81930300059144178458…74528827632302968131
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
8.193 × 10⁹⁴(95-digit number)
81930300059144178458…74528827632302968131
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.638 × 10⁹⁵(96-digit number)
16386060011828835691…49057655264605936261
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.277 × 10⁹⁵(96-digit number)
32772120023657671383…98115310529211872521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.554 × 10⁹⁵(96-digit number)
65544240047315342766…96230621058423745041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.310 × 10⁹⁶(97-digit number)
13108848009463068553…92461242116847490081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.621 × 10⁹⁶(97-digit number)
26217696018926137106…84922484233694980161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.243 × 10⁹⁶(97-digit number)
52435392037852274213…69844968467389960321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.048 × 10⁹⁷(98-digit number)
10487078407570454842…39689936934779920641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.097 × 10⁹⁷(98-digit number)
20974156815140909685…79379873869559841281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.194 × 10⁹⁷(98-digit number)
41948313630281819370…58759747739119682561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.389 × 10⁹⁷(98-digit number)
83896627260563638741…17519495478239365121
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,990,093 XPM·at block #6,843,214 · 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