Block #4,065,133

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/4/2021, 11:03:01 AM · Difficulty 10.8030 · 2,752,124 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1ec0fb6392252d178947fe4635f0734ecb7b719344385f17e7310be375df852b

Height

#4,065,133

Difficulty

10.803012

Transactions

3

Size

617 B

Version

2

Bits

0acd9239

Nonce

247,667,596

Timestamp

2/4/2021, 11:03:01 AM

Confirmations

2,752,124

Merkle Root

864c96cc377c69e5cec0caf9b19a5b2330d6507572ed998fa4200247ceae6aa2
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.627 × 10⁹⁴(95-digit number)
26270966834026356324…05364419135481359499
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.627 × 10⁹⁴(95-digit number)
26270966834026356324…05364419135481359499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.254 × 10⁹⁴(95-digit number)
52541933668052712648…10728838270962718999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.050 × 10⁹⁵(96-digit number)
10508386733610542529…21457676541925437999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.101 × 10⁹⁵(96-digit number)
21016773467221085059…42915353083850875999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.203 × 10⁹⁵(96-digit number)
42033546934442170119…85830706167701751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.406 × 10⁹⁵(96-digit number)
84067093868884340238…71661412335403503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.681 × 10⁹⁶(97-digit number)
16813418773776868047…43322824670807007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.362 × 10⁹⁶(97-digit number)
33626837547553736095…86645649341614015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.725 × 10⁹⁶(97-digit number)
67253675095107472190…73291298683228031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.345 × 10⁹⁷(98-digit number)
13450735019021494438…46582597366456063999
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,091 XPM·at block #6,817,256 · 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