Block #4,058,981

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/31/2021, 4:16:22 AM · Difficulty 10.8034 · 2,758,385 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a5c2af0f9d6f19ad1a736c812b81f5a2176650fca17783e43ee23c8b396ea100

Height

#4,058,981

Difficulty

10.803375

Transactions

3

Size

2.46 KB

Version

2

Bits

0acda9fb

Nonce

459,964,827

Timestamp

1/31/2021, 4:16:22 AM

Confirmations

2,758,385

Merkle Root

e679814c06a0ee511cba4f6a34630d0e8363164c85f8569bd7e802f311311187
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.

3.689 × 10⁹³(94-digit number)
36890204082750486070…41516430790856376319
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.689 × 10⁹³(94-digit number)
36890204082750486070…41516430790856376319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.378 × 10⁹³(94-digit number)
73780408165500972141…83032861581712752639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.475 × 10⁹⁴(95-digit number)
14756081633100194428…66065723163425505279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.951 × 10⁹⁴(95-digit number)
29512163266200388856…32131446326851010559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.902 × 10⁹⁴(95-digit number)
59024326532400777713…64262892653702021119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.180 × 10⁹⁵(96-digit number)
11804865306480155542…28525785307404042239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.360 × 10⁹⁵(96-digit number)
23609730612960311085…57051570614808084479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.721 × 10⁹⁵(96-digit number)
47219461225920622170…14103141229616168959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.443 × 10⁹⁵(96-digit number)
94438922451841244341…28206282459232337919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.888 × 10⁹⁶(97-digit number)
18887784490368248868…56412564918464675839
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,968 XPM·at block #6,817,365 · 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