Block #679,975

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/16/2014, 9:11:29 AM · Difficulty 10.9628 · 6,126,911 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8ee7aa0bf372de48e1152316be2b4784837833f61bc8c0d619c53a6cb06d5531

Height

#679,975

Difficulty

10.962767

Transactions

4

Size

1.29 KB

Version

2

Bits

0af677ec

Nonce

2,078,097,092

Timestamp

8/16/2014, 9:11:29 AM

Confirmations

6,126,911

Merkle Root

3e27bb28a411bbf427a87e1b21a54a4eb35a8ace6d21b2b0cdfb0559b71dd74d
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.

5.696 × 10⁹⁶(97-digit number)
56964395497958401475…28022018445899962879
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
5.696 × 10⁹⁶(97-digit number)
56964395497958401475…28022018445899962879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.139 × 10⁹⁷(98-digit number)
11392879099591680295…56044036891799925759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.278 × 10⁹⁷(98-digit number)
22785758199183360590…12088073783599851519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.557 × 10⁹⁷(98-digit number)
45571516398366721180…24176147567199703039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.114 × 10⁹⁷(98-digit number)
91143032796733442360…48352295134399406079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.822 × 10⁹⁸(99-digit number)
18228606559346688472…96704590268798812159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.645 × 10⁹⁸(99-digit number)
36457213118693376944…93409180537597624319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.291 × 10⁹⁸(99-digit number)
72914426237386753888…86818361075195248639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.458 × 10⁹⁹(100-digit number)
14582885247477350777…73636722150390497279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.916 × 10⁹⁹(100-digit number)
29165770494954701555…47273444300780994559
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,699,195 XPM·at block #6,806,885 · 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