Block #760,768

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/10/2014, 4:48:11 PM · Difficulty 10.9724 · 6,049,184 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d8a2f7062723714e1487bc6ebe593bb34dde9668097460f3a46e38d267c8bc15

Height

#760,768

Difficulty

10.972442

Transactions

10

Size

3.05 KB

Version

2

Bits

0af8f1ee

Nonce

1,909,553,897

Timestamp

10/10/2014, 4:48:11 PM

Confirmations

6,049,184

Merkle Root

a9de74794662e9b3d364e3f4fe597ad52d25bac33e5b5c3646eab558f1dcfc67
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.440 × 10⁹⁷(98-digit number)
14405774062858976026…76236177546095006719
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.440 × 10⁹⁷(98-digit number)
14405774062858976026…76236177546095006719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.881 × 10⁹⁷(98-digit number)
28811548125717952053…52472355092190013439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.762 × 10⁹⁷(98-digit number)
57623096251435904106…04944710184380026879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.152 × 10⁹⁸(99-digit number)
11524619250287180821…09889420368760053759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.304 × 10⁹⁸(99-digit number)
23049238500574361642…19778840737520107519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.609 × 10⁹⁸(99-digit number)
46098477001148723284…39557681475040215039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.219 × 10⁹⁸(99-digit number)
92196954002297446569…79115362950080430079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.843 × 10⁹⁹(100-digit number)
18439390800459489313…58230725900160860159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.687 × 10⁹⁹(100-digit number)
36878781600918978627…16461451800321720319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.375 × 10⁹⁹(100-digit number)
73757563201837957255…32922903600643440639
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,723,697 XPM·at block #6,809,951 · 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