Block #789,559

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/30/2014, 3:00:24 PM · Difficulty 10.9741 · 6,018,515 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
313990760d501bae986080409432479d46af262d94923d15828c06d48a6be408

Height

#789,559

Difficulty

10.974069

Transactions

5

Size

2.82 KB

Version

2

Bits

0af95c94

Nonce

401,266,919

Timestamp

10/30/2014, 3:00:24 PM

Confirmations

6,018,515

Merkle Root

4a5b9d5731640056939c32a80b04e0a7bea0f977b2bd73a1972496087341281d
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.161 × 10⁹⁶(97-digit number)
21618480216205400041…80888764652119151599
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.161 × 10⁹⁶(97-digit number)
21618480216205400041…80888764652119151599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.323 × 10⁹⁶(97-digit number)
43236960432410800083…61777529304238303199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.647 × 10⁹⁶(97-digit number)
86473920864821600166…23555058608476606399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.729 × 10⁹⁷(98-digit number)
17294784172964320033…47110117216953212799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.458 × 10⁹⁷(98-digit number)
34589568345928640066…94220234433906425599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.917 × 10⁹⁷(98-digit number)
69179136691857280133…88440468867812851199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.383 × 10⁹⁸(99-digit number)
13835827338371456026…76880937735625702399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.767 × 10⁹⁸(99-digit number)
27671654676742912053…53761875471251404799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.534 × 10⁹⁸(99-digit number)
55343309353485824106…07523750942502809599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.106 × 10⁹⁹(100-digit number)
11068661870697164821…15047501885005619199
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,708,638 XPM·at block #6,808,073 · 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