Block #841,753

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/6/2014, 2:58:50 AM · Difficulty 10.9739 · 5,994,798 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
03ec33650abf8500bca2befabc81b6b0329aecb00cf463067804f68c337c01bc

Height

#841,753

Difficulty

10.973946

Transactions

5

Size

1.23 KB

Version

2

Bits

0af95489

Nonce

1,380,067,000

Timestamp

12/6/2014, 2:58:50 AM

Confirmations

5,994,798

Merkle Root

bda7653bb2477718a5ed22d35637a87e63a0e72803818700920a4caa96560862
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.068 × 10⁹⁹(100-digit number)
10686577351650544459…11736628650664755201
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.068 × 10⁹⁹(100-digit number)
10686577351650544459…11736628650664755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.137 × 10⁹⁹(100-digit number)
21373154703301088919…23473257301329510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.274 × 10⁹⁹(100-digit number)
42746309406602177838…46946514602659020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.549 × 10⁹⁹(100-digit number)
85492618813204355676…93893029205318041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.709 × 10¹⁰⁰(101-digit number)
17098523762640871135…87786058410636083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.419 × 10¹⁰⁰(101-digit number)
34197047525281742270…75572116821272166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.839 × 10¹⁰⁰(101-digit number)
68394095050563484540…51144233642544332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.367 × 10¹⁰¹(102-digit number)
13678819010112696908…02288467285088665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.735 × 10¹⁰¹(102-digit number)
27357638020225393816…04576934570177331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.471 × 10¹⁰¹(102-digit number)
54715276040450787632…09153869140354662401
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,936,673 XPM·at block #6,836,550 · 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