Block #778,907

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/22/2014, 12:33:49 PM · Difficulty 10.9785 · 6,038,308 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5696e2c5269fbe32d50a182a4c82a651e64c87fac466b9ffba8c91f1abb5385c

Height

#778,907

Difficulty

10.978462

Transactions

4

Size

3.17 KB

Version

2

Bits

0afa7c77

Nonce

19,345

Timestamp

10/22/2014, 12:33:49 PM

Confirmations

6,038,308

Merkle Root

42159c3182649f6e98be0367d59a93b9bc8c18e01aa77cd46743c5d3e0c43c4b
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.000 × 10⁹⁷(98-digit number)
10004815488651118275…96137808617495934099
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.000 × 10⁹⁷(98-digit number)
10004815488651118275…96137808617495934099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.000 × 10⁹⁷(98-digit number)
20009630977302236551…92275617234991868199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.001 × 10⁹⁷(98-digit number)
40019261954604473102…84551234469983736399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.003 × 10⁹⁷(98-digit number)
80038523909208946205…69102468939967472799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.600 × 10⁹⁸(99-digit number)
16007704781841789241…38204937879934945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.201 × 10⁹⁸(99-digit number)
32015409563683578482…76409875759869891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.403 × 10⁹⁸(99-digit number)
64030819127367156964…52819751519739782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.280 × 10⁹⁹(100-digit number)
12806163825473431392…05639503039479564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.561 × 10⁹⁹(100-digit number)
25612327650946862785…11279006078959129599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.122 × 10⁹⁹(100-digit number)
51224655301893725571…22558012157918259199
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,781,758 XPM·at block #6,817,214 · 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