Block #725,857

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/17/2014, 1:47:54 PM · Difficulty 10.9604 · 6,099,455 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
91922fb410ea4688e4ac2f21582ea60da8b845f1d06baf0d3a2e1a2840a9d767

Height

#725,857

Difficulty

10.960435

Transactions

5

Size

1.52 KB

Version

2

Bits

0af5df16

Nonce

1,246,061,115

Timestamp

9/17/2014, 1:47:54 PM

Confirmations

6,099,455

Merkle Root

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

4.436 × 10⁹⁶(97-digit number)
44368676891627138518…46433036942822846081
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
4.436 × 10⁹⁶(97-digit number)
44368676891627138518…46433036942822846081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.873 × 10⁹⁶(97-digit number)
88737353783254277036…92866073885645692161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.774 × 10⁹⁷(98-digit number)
17747470756650855407…85732147771291384321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.549 × 10⁹⁷(98-digit number)
35494941513301710814…71464295542582768641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.098 × 10⁹⁷(98-digit number)
70989883026603421629…42928591085165537281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.419 × 10⁹⁸(99-digit number)
14197976605320684325…85857182170331074561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.839 × 10⁹⁸(99-digit number)
28395953210641368651…71714364340662149121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.679 × 10⁹⁸(99-digit number)
56791906421282737303…43428728681324298241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.135 × 10⁹⁹(100-digit number)
11358381284256547460…86857457362648596481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.271 × 10⁹⁹(100-digit number)
22716762568513094921…73714914725297192961
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,846,599 XPM·at block #6,825,311 · 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