Block #3,518,597

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/17/2020, 1:33:57 PM · Difficulty 10.9348 · 3,298,718 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
669bfeee1801b604a7a0216e04fd255b2e36d69c57c25bdbac9ed32128689d57

Height

#3,518,597

Difficulty

10.934837

Transactions

5

Size

2.78 KB

Version

2

Bits

0aef5177

Nonce

339,162,167

Timestamp

1/17/2020, 1:33:57 PM

Confirmations

3,298,718

Merkle Root

a07a6307fb1648925fc1aae0bb23579070b03b85542441f07a00c059d50c183a
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.489 × 10⁹⁵(96-digit number)
14891610680784906033…61170476662499389439
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.489 × 10⁹⁵(96-digit number)
14891610680784906033…61170476662499389439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.978 × 10⁹⁵(96-digit number)
29783221361569812066…22340953324998778879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.956 × 10⁹⁵(96-digit number)
59566442723139624133…44681906649997557759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.191 × 10⁹⁶(97-digit number)
11913288544627924826…89363813299995115519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.382 × 10⁹⁶(97-digit number)
23826577089255849653…78727626599990231039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.765 × 10⁹⁶(97-digit number)
47653154178511699306…57455253199980462079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.530 × 10⁹⁶(97-digit number)
95306308357023398613…14910506399960924159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.906 × 10⁹⁷(98-digit number)
19061261671404679722…29821012799921848319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.812 × 10⁹⁷(98-digit number)
38122523342809359445…59642025599843696639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.624 × 10⁹⁷(98-digit number)
76245046685618718890…19284051199687393279
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,782,565 XPM·at block #6,817,314 · 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