Block #839,615

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2014, 1:14:21 PM · Difficulty 10.9745 · 6,001,409 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d4b80fe6049b90b93eca3bcfaf3eb506a67c85ca07b02f019402c29f19377027

Height

#839,615

Difficulty

10.974537

Transactions

6

Size

1.27 KB

Version

2

Bits

0af97b48

Nonce

392,020,222

Timestamp

12/4/2014, 1:14:21 PM

Confirmations

6,001,409

Merkle Root

cc74da9edfdd4a7749ad601cf7f0c286f44705359a5b437015fb7bc21a60cd16
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.294 × 10⁹⁶(97-digit number)
12943958097146286094…15206333452956597761
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.294 × 10⁹⁶(97-digit number)
12943958097146286094…15206333452956597761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.588 × 10⁹⁶(97-digit number)
25887916194292572188…30412666905913195521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.177 × 10⁹⁶(97-digit number)
51775832388585144377…60825333811826391041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.035 × 10⁹⁷(98-digit number)
10355166477717028875…21650667623652782081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.071 × 10⁹⁷(98-digit number)
20710332955434057751…43301335247305564161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.142 × 10⁹⁷(98-digit number)
41420665910868115502…86602670494611128321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.284 × 10⁹⁷(98-digit number)
82841331821736231004…73205340989222256641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.656 × 10⁹⁸(99-digit number)
16568266364347246200…46410681978444513281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.313 × 10⁹⁸(99-digit number)
33136532728694492401…92821363956889026561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.627 × 10⁹⁸(99-digit number)
66273065457388984803…85642727913778053121
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,972,549 XPM·at block #6,841,023 · 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