Block #691,069

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/24/2014, 6:38:08 PM · Difficulty 10.9551 · 6,125,406 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ba9a588c9188ccc7234ce4d334690322457c914bbffb437e1da0af0c93d327ae

Height

#691,069

Difficulty

10.955051

Transactions

2

Size

434 B

Version

2

Bits

0af47e40

Nonce

512,827,767

Timestamp

8/24/2014, 6:38:08 PM

Confirmations

6,125,406

Merkle Root

348c58f59999f67f342498de9aa28a5b899fd2414d719f458a005b259641e684
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.744 × 10⁹⁵(96-digit number)
77446175473275865301…22664640056892758879
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.744 × 10⁹⁵(96-digit number)
77446175473275865301…22664640056892758879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.548 × 10⁹⁶(97-digit number)
15489235094655173060…45329280113785517759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.097 × 10⁹⁶(97-digit number)
30978470189310346120…90658560227571035519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.195 × 10⁹⁶(97-digit number)
61956940378620692241…81317120455142071039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.239 × 10⁹⁷(98-digit number)
12391388075724138448…62634240910284142079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.478 × 10⁹⁷(98-digit number)
24782776151448276896…25268481820568284159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.956 × 10⁹⁷(98-digit number)
49565552302896553793…50536963641136568319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.913 × 10⁹⁷(98-digit number)
99131104605793107586…01073927282273136639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.982 × 10⁹⁸(99-digit number)
19826220921158621517…02147854564546273279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.965 × 10⁹⁸(99-digit number)
39652441842317243034…04295709129092546559
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,775,930 XPM·at block #6,816,474 · 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