Block #709,907

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/6/2014, 6:51:38 PM · Difficulty 10.9566 · 6,098,400 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a1afc6540646f970bec714e6e407a5fcaf7058895ea2e794897e2e27765905bf

Height

#709,907

Difficulty

10.956578

Transactions

5

Size

1.34 KB

Version

2

Bits

0af4e24a

Nonce

1,977,965,574

Timestamp

9/6/2014, 6:51:38 PM

Confirmations

6,098,400

Merkle Root

2ff215ca815c42a6f4e7d5d6bf8bbf85460518a0522412a8c2e20c5d553b0a5d
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.814 × 10⁹⁶(97-digit number)
28146502324511848273…75718252281558139521
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.814 × 10⁹⁶(97-digit number)
28146502324511848273…75718252281558139521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.629 × 10⁹⁶(97-digit number)
56293004649023696547…51436504563116279041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.125 × 10⁹⁷(98-digit number)
11258600929804739309…02873009126232558081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.251 × 10⁹⁷(98-digit number)
22517201859609478619…05746018252465116161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.503 × 10⁹⁷(98-digit number)
45034403719218957238…11492036504930232321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.006 × 10⁹⁷(98-digit number)
90068807438437914476…22984073009860464641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.801 × 10⁹⁸(99-digit number)
18013761487687582895…45968146019720929281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.602 × 10⁹⁸(99-digit number)
36027522975375165790…91936292039441858561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.205 × 10⁹⁸(99-digit number)
72055045950750331581…83872584078883717121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.441 × 10⁹⁹(100-digit number)
14411009190150066316…67745168157767434241
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,710,511 XPM·at block #6,808,306 · 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