Block #717,047

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/12/2014, 3:05:16 AM · Difficulty 10.9518 · 6,089,237 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f2141803731ead3f3df4c3b1d8e663122fcf01aa0b56a6b48da1fef0646413e8

Height

#717,047

Difficulty

10.951776

Transactions

2

Size

682 B

Version

2

Bits

0af3a79b

Nonce

1,127,294,538

Timestamp

9/12/2014, 3:05:16 AM

Confirmations

6,089,237

Merkle Root

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

7.769 × 10⁹⁴(95-digit number)
77697877089648734499…73438963776378167681
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
7.769 × 10⁹⁴(95-digit number)
77697877089648734499…73438963776378167681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.553 × 10⁹⁵(96-digit number)
15539575417929746899…46877927552756335361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.107 × 10⁹⁵(96-digit number)
31079150835859493799…93755855105512670721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.215 × 10⁹⁵(96-digit number)
62158301671718987599…87511710211025341441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.243 × 10⁹⁶(97-digit number)
12431660334343797519…75023420422050682881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.486 × 10⁹⁶(97-digit number)
24863320668687595039…50046840844101365761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.972 × 10⁹⁶(97-digit number)
49726641337375190079…00093681688202731521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.945 × 10⁹⁶(97-digit number)
99453282674750380159…00187363376405463041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.989 × 10⁹⁷(98-digit number)
19890656534950076031…00374726752810926081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.978 × 10⁹⁷(98-digit number)
39781313069900152063…00749453505621852161
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,694,358 XPM·at block #6,806,283 · 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