Block #4,056,891

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/29/2021, 5:50:47 PM · Difficulty 10.8024 · 2,767,684 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
538abdfe0293bd0a61b68871d7bbf7caf52dcd626f9553a518961dd2fc289a4f

Height

#4,056,891

Difficulty

10.802368

Transactions

3

Size

1.18 KB

Version

2

Bits

0acd67fc

Nonce

493,770,689

Timestamp

1/29/2021, 5:50:47 PM

Confirmations

2,767,684

Merkle Root

e36fc04e986fac825bbcd5052ba365ab317952914e0b46206490f25e79690369
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.610 × 10⁹⁷(98-digit number)
36108156982536751453…20343923444011304959
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.610 × 10⁹⁷(98-digit number)
36108156982536751453…20343923444011304959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.221 × 10⁹⁷(98-digit number)
72216313965073502906…40687846888022609919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.444 × 10⁹⁸(99-digit number)
14443262793014700581…81375693776045219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.888 × 10⁹⁸(99-digit number)
28886525586029401162…62751387552090439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.777 × 10⁹⁸(99-digit number)
57773051172058802325…25502775104180879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.155 × 10⁹⁹(100-digit number)
11554610234411760465…51005550208361758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.310 × 10⁹⁹(100-digit number)
23109220468823520930…02011100416723517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.621 × 10⁹⁹(100-digit number)
46218440937647041860…04022200833447034879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.243 × 10⁹⁹(100-digit number)
92436881875294083720…08044401666894069759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.848 × 10¹⁰⁰(101-digit number)
18487376375058816744…16088803333788139519
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,840,666 XPM·at block #6,824,574 · 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