Block #841,782

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/6/2014, 3:29:52 AM · Difficulty 10.9739 · 6,000,624 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4dc0052f95a9ec5fc1c4446c2ecb808156425c508ee8311b7db00fe137f7cd5d

Height

#841,782

Difficulty

10.973943

Transactions

3

Size

686 B

Version

2

Bits

0af95450

Nonce

235,096,090

Timestamp

12/6/2014, 3:29:52 AM

Confirmations

6,000,624

Merkle Root

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

3.708 × 10⁹³(94-digit number)
37085761155046635728…95395056631660231311
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
3.708 × 10⁹³(94-digit number)
37085761155046635728…95395056631660231311
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.417 × 10⁹³(94-digit number)
74171522310093271456…90790113263320462621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.483 × 10⁹⁴(95-digit number)
14834304462018654291…81580226526640925241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.966 × 10⁹⁴(95-digit number)
29668608924037308582…63160453053281850481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.933 × 10⁹⁴(95-digit number)
59337217848074617164…26320906106563700961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.186 × 10⁹⁵(96-digit number)
11867443569614923432…52641812213127401921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.373 × 10⁹⁵(96-digit number)
23734887139229846865…05283624426254803841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.746 × 10⁹⁵(96-digit number)
47469774278459693731…10567248852509607681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.493 × 10⁹⁵(96-digit number)
94939548556919387463…21134497705019215361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.898 × 10⁹⁶(97-digit number)
18987909711383877492…42268995410038430721
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,983,660 XPM·at block #6,842,405 · 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