Block #845,637

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2014, 12:45:42 AM · Difficulty 10.9725 · 5,985,325 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b94eeee86c180cae2fa96d056beb0053daaf1fcf40d069f47d338a6c6f0f9b8f

Height

#845,637

Difficulty

10.972460

Transactions

5

Size

1.52 KB

Version

2

Bits

0af8f325

Nonce

845,186,495

Timestamp

12/9/2014, 12:45:42 AM

Confirmations

5,985,325

Merkle Root

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

2.687 × 10⁹⁷(98-digit number)
26878257194529208039…32127063207129139201
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
2.687 × 10⁹⁷(98-digit number)
26878257194529208039…32127063207129139201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.375 × 10⁹⁷(98-digit number)
53756514389058416078…64254126414258278401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.075 × 10⁹⁸(99-digit number)
10751302877811683215…28508252828516556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.150 × 10⁹⁸(99-digit number)
21502605755623366431…57016505657033113601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.300 × 10⁹⁸(99-digit number)
43005211511246732862…14033011314066227201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.601 × 10⁹⁸(99-digit number)
86010423022493465725…28066022628132454401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.720 × 10⁹⁹(100-digit number)
17202084604498693145…56132045256264908801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.440 × 10⁹⁹(100-digit number)
34404169208997386290…12264090512529817601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.880 × 10⁹⁹(100-digit number)
68808338417994772580…24528181025059635201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.376 × 10¹⁰⁰(101-digit number)
13761667683598954516…49056362050119270401
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,891,833 XPM·at block #6,830,961 · 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