Block #725,579

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/17/2014, 9:25:36 AM · Difficulty 10.9603 · 6,083,563 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5b9a39aa1be671b812f8c9dfdcf6059431620ae2b3e40aee6854fabd87bd6d13

Height

#725,579

Difficulty

10.960310

Transactions

6

Size

1.60 KB

Version

2

Bits

0af5d6e3

Nonce

3,056,766,282

Timestamp

9/17/2014, 9:25:36 AM

Confirmations

6,083,563

Merkle Root

09203b4cbf33fa8b7e4fafb60d2a6b326b904dc8cc1afdc3e3dcbd68e6a882d8
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.297 × 10⁹⁷(98-digit number)
12978491230859594691…63888843241848970241
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.297 × 10⁹⁷(98-digit number)
12978491230859594691…63888843241848970241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.595 × 10⁹⁷(98-digit number)
25956982461719189383…27777686483697940481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.191 × 10⁹⁷(98-digit number)
51913964923438378766…55555372967395880961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.038 × 10⁹⁸(99-digit number)
10382792984687675753…11110745934791761921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.076 × 10⁹⁸(99-digit number)
20765585969375351506…22221491869583523841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.153 × 10⁹⁸(99-digit number)
41531171938750703012…44442983739167047681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.306 × 10⁹⁸(99-digit number)
83062343877501406025…88885967478334095361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.661 × 10⁹⁹(100-digit number)
16612468775500281205…77771934956668190721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.322 × 10⁹⁹(100-digit number)
33224937551000562410…55543869913336381441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.644 × 10⁹⁹(100-digit number)
66449875102001124820…11087739826672762881
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,197 XPM·at block #6,809,141 · 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