Block #3,967,818

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/27/2020, 12:14:21 PM · Difficulty 10.8643 · 2,858,757 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5fbae92e2011c12c91e5699710495915f3ecfaf00bda9a1acbb92b137f0ddb03

Height

#3,967,818

Difficulty

10.864273

Transactions

6

Size

2.49 KB

Version

2

Bits

0add4101

Nonce

1,308,406,675

Timestamp

11/27/2020, 12:14:21 PM

Confirmations

2,858,757

Merkle Root

1961f1bdcd42e693bc90882ee57e3b735777d9c6b235ab8e7589b636aff24686
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.

2.952 × 10⁹⁵(96-digit number)
29526492058880863102…22384535905448287999
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
2.952 × 10⁹⁵(96-digit number)
29526492058880863102…22384535905448287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.905 × 10⁹⁵(96-digit number)
59052984117761726204…44769071810896575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.181 × 10⁹⁶(97-digit number)
11810596823552345240…89538143621793151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.362 × 10⁹⁶(97-digit number)
23621193647104690481…79076287243586303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.724 × 10⁹⁶(97-digit number)
47242387294209380963…58152574487172607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.448 × 10⁹⁶(97-digit number)
94484774588418761927…16305148974345215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.889 × 10⁹⁷(98-digit number)
18896954917683752385…32610297948690431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.779 × 10⁹⁷(98-digit number)
37793909835367504771…65220595897380863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.558 × 10⁹⁷(98-digit number)
75587819670735009542…30441191794761727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.511 × 10⁹⁸(99-digit number)
15117563934147001908…60882383589523455999
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,856,749 XPM·at block #6,826,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