Block #1,677,501

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/17/2016, 8:54:03 PM · Difficulty 10.6947 · 5,164,991 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8a85b1e2ca39e1273989409a21715c8de30533140530b8fcdb11da104ddc40cf

Height

#1,677,501

Difficulty

10.694656

Transactions

33

Size

11.64 KB

Version

2

Bits

0ab1d4fd

Nonce

2,064,687,755

Timestamp

7/17/2016, 8:54:03 PM

Confirmations

5,164,991

Merkle Root

1badb4dea96547800f531c94f623684ffeabbafbf73ff4053f75f3a21cc21115
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.

6.741 × 10⁹⁴(95-digit number)
67410547406324864404…32987110100169825919
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
6.741 × 10⁹⁴(95-digit number)
67410547406324864404…32987110100169825919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.348 × 10⁹⁵(96-digit number)
13482109481264972880…65974220200339651839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.696 × 10⁹⁵(96-digit number)
26964218962529945761…31948440400679303679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.392 × 10⁹⁵(96-digit number)
53928437925059891523…63896880801358607359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.078 × 10⁹⁶(97-digit number)
10785687585011978304…27793761602717214719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.157 × 10⁹⁶(97-digit number)
21571375170023956609…55587523205434429439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.314 × 10⁹⁶(97-digit number)
43142750340047913218…11175046410868858879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.628 × 10⁹⁶(97-digit number)
86285500680095826437…22350092821737717759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.725 × 10⁹⁷(98-digit number)
17257100136019165287…44700185643475435519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.451 × 10⁹⁷(98-digit number)
34514200272038330575…89400371286950871039
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,984,354 XPM·at block #6,842,491 · 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