Block #3,961,479

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/22/2020, 10:27:30 PM · Difficulty 10.8706 · 2,852,840 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7e1a2e26b3e51843c63c32e792aaf9e5d88b00dbf7caf7d813970afa2afb1dbd

Height

#3,961,479

Difficulty

10.870583

Transactions

3

Size

2.15 KB

Version

2

Bits

0adede85

Nonce

898,513,295

Timestamp

11/22/2020, 10:27:30 PM

Confirmations

2,852,840

Merkle Root

acd338f37c19837b863dc12ad410f8a837faa131cc084609206004fabf3c3da0
Transactions (3)
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.935 × 10⁹⁵(96-digit number)
29355881687246796260…44621854510280073519
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.935 × 10⁹⁵(96-digit number)
29355881687246796260…44621854510280073519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.871 × 10⁹⁵(96-digit number)
58711763374493592520…89243709020560147039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.174 × 10⁹⁶(97-digit number)
11742352674898718504…78487418041120294079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.348 × 10⁹⁶(97-digit number)
23484705349797437008…56974836082240588159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.696 × 10⁹⁶(97-digit number)
46969410699594874016…13949672164481176319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.393 × 10⁹⁶(97-digit number)
93938821399189748033…27899344328962352639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.878 × 10⁹⁷(98-digit number)
18787764279837949606…55798688657924705279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.757 × 10⁹⁷(98-digit number)
37575528559675899213…11597377315849410559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.515 × 10⁹⁷(98-digit number)
75151057119351798426…23194754631698821119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.503 × 10⁹⁸(99-digit number)
15030211423870359685…46389509263397642239
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,758,616 XPM·at block #6,814,318 · 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