Block #1,748,603

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/5/2016, 4:45:30 AM · Difficulty 10.7013 · 5,069,342 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c166ae9745b061d8a134073d1bac85e6b86ac03bf9e0d98557d5b8b9ad284022

Height

#1,748,603

Difficulty

10.701328

Transactions

2

Size

1.71 KB

Version

2

Bits

0ab38a3b

Nonce

785,420,299

Timestamp

9/5/2016, 4:45:30 AM

Confirmations

5,069,342

Merkle Root

0a6e29196e00eadf75cf3b3ed66789b877b55884c52bc41a09e60ff556cf640a
Transactions (2)
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.

3.953 × 10⁹⁶(97-digit number)
39536508990818337710…93891414701378744319
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
3.953 × 10⁹⁶(97-digit number)
39536508990818337710…93891414701378744319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.907 × 10⁹⁶(97-digit number)
79073017981636675421…87782829402757488639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.581 × 10⁹⁷(98-digit number)
15814603596327335084…75565658805514977279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.162 × 10⁹⁷(98-digit number)
31629207192654670168…51131317611029954559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.325 × 10⁹⁷(98-digit number)
63258414385309340337…02262635222059909119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.265 × 10⁹⁸(99-digit number)
12651682877061868067…04525270444119818239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.530 × 10⁹⁸(99-digit number)
25303365754123736134…09050540888239636479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.060 × 10⁹⁸(99-digit number)
50606731508247472269…18101081776479272959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.012 × 10⁹⁹(100-digit number)
10121346301649494453…36202163552958545919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.024 × 10⁹⁹(100-digit number)
20242692603298988907…72404327105917091839
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,787,627 XPM·at block #6,817,944 · 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