Block #700,569

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/31/2014, 2:07:05 AM · Difficulty 10.9589 · 6,108,600 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
51b2fce1f73252a3d7c246a76384db328b825668f7ec8dcb32104f828d995a02

Height

#700,569

Difficulty

10.958855

Transactions

5

Size

2.49 KB

Version

2

Bits

0af57789

Nonce

188,260,409

Timestamp

8/31/2014, 2:07:05 AM

Confirmations

6,108,600

Merkle Root

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

2.558 × 10⁹⁶(97-digit number)
25583591012333423786…00176166319971473921
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
2.558 × 10⁹⁶(97-digit number)
25583591012333423786…00176166319971473921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.116 × 10⁹⁶(97-digit number)
51167182024666847572…00352332639942947841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.023 × 10⁹⁷(98-digit number)
10233436404933369514…00704665279885895681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.046 × 10⁹⁷(98-digit number)
20466872809866739028…01409330559771791361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.093 × 10⁹⁷(98-digit number)
40933745619733478057…02818661119543582721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.186 × 10⁹⁷(98-digit number)
81867491239466956115…05637322239087165441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.637 × 10⁹⁸(99-digit number)
16373498247893391223…11274644478174330881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.274 × 10⁹⁸(99-digit number)
32746996495786782446…22549288956348661761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.549 × 10⁹⁸(99-digit number)
65493992991573564892…45098577912697323521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.309 × 10⁹⁹(100-digit number)
13098798598314712978…90197155825394647041
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,717,414 XPM·at block #6,809,168 · 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