Block #751,989

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/4/2014, 10:18:40 AM · Difficulty 10.9735 · 6,090,992 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0031821ac971d970c55fc15fd20d5fd193749a374146d2ebad34934ba6195c37

Height

#751,989

Difficulty

10.973528

Transactions

4

Size

3.89 KB

Version

2

Bits

0af93926

Nonce

1,118,859,535

Timestamp

10/4/2014, 10:18:40 AM

Confirmations

6,090,992

Merkle Root

38cafeeb024fe141990523cdc5183dbda195de3a07066572965fd7cf9a3ae7e3
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.026 × 10⁹⁶(97-digit number)
10269891891467836687…24765308383805884161
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.026 × 10⁹⁶(97-digit number)
10269891891467836687…24765308383805884161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.053 × 10⁹⁶(97-digit number)
20539783782935673374…49530616767611768321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.107 × 10⁹⁶(97-digit number)
41079567565871346748…99061233535223536641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.215 × 10⁹⁶(97-digit number)
82159135131742693496…98122467070447073281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.643 × 10⁹⁷(98-digit number)
16431827026348538699…96244934140894146561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.286 × 10⁹⁷(98-digit number)
32863654052697077398…92489868281788293121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.572 × 10⁹⁷(98-digit number)
65727308105394154797…84979736563576586241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.314 × 10⁹⁸(99-digit number)
13145461621078830959…69959473127153172481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.629 × 10⁹⁸(99-digit number)
26290923242157661918…39918946254306344961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.258 × 10⁹⁸(99-digit number)
52581846484315323837…79837892508612689921
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,988,202 XPM·at block #6,842,980 · 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