Block #673,782

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/11/2014, 7:28:37 PM · Difficulty 10.9653 · 6,134,104 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0ac8a9556c570c661d9e39cb22a13f77aab381a566f64b2574669fd010053e18

Height

#673,782

Difficulty

10.965321

Transactions

11

Size

3.32 KB

Version

2

Bits

0af71f3f

Nonce

70,005,054

Timestamp

8/11/2014, 7:28:37 PM

Confirmations

6,134,104

Merkle Root

34d5a29524462a20a74b42e487ff9cdc140d9de1f7b6b1c200036210cc685af5
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.

8.730 × 10⁹⁶(97-digit number)
87301620166741732523…56286390387238533121
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
8.730 × 10⁹⁶(97-digit number)
87301620166741732523…56286390387238533121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.746 × 10⁹⁷(98-digit number)
17460324033348346504…12572780774477066241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.492 × 10⁹⁷(98-digit number)
34920648066696693009…25145561548954132481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.984 × 10⁹⁷(98-digit number)
69841296133393386018…50291123097908264961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.396 × 10⁹⁸(99-digit number)
13968259226678677203…00582246195816529921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.793 × 10⁹⁸(99-digit number)
27936518453357354407…01164492391633059841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.587 × 10⁹⁸(99-digit number)
55873036906714708815…02328984783266119681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.117 × 10⁹⁹(100-digit number)
11174607381342941763…04657969566532239361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.234 × 10⁹⁹(100-digit number)
22349214762685883526…09315939133064478721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.469 × 10⁹⁹(100-digit number)
44698429525371767052…18631878266128957441
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,707,123 XPM·at block #6,807,885 · 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.

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