Block #4,007,029

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/25/2020, 6:28:05 AM · Difficulty 10.8434 · 2,819,529 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0daba0c867fa0806e0c71deff28c796c18a1c63d489465e3865f81c98ced9b03

Height

#4,007,029

Difficulty

10.843366

Transactions

14

Size

4.99 KB

Version

2

Bits

0ad7e6d5

Nonce

1,708,486,149

Timestamp

12/25/2020, 6:28:05 AM

Confirmations

2,819,529

Merkle Root

e7d401719c90b05764275526f8947b16ae2e7d53a942ff95a4057e9fc09e85ce
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.423 × 10⁹⁴(95-digit number)
34230632765389154617…78616674887296020479
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.423 × 10⁹⁴(95-digit number)
34230632765389154617…78616674887296020479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.846 × 10⁹⁴(95-digit number)
68461265530778309235…57233349774592040959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.369 × 10⁹⁵(96-digit number)
13692253106155661847…14466699549184081919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.738 × 10⁹⁵(96-digit number)
27384506212311323694…28933399098368163839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.476 × 10⁹⁵(96-digit number)
54769012424622647388…57866798196736327679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.095 × 10⁹⁶(97-digit number)
10953802484924529477…15733596393472655359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.190 × 10⁹⁶(97-digit number)
21907604969849058955…31467192786945310719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.381 × 10⁹⁶(97-digit number)
43815209939698117911…62934385573890621439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.763 × 10⁹⁶(97-digit number)
87630419879396235822…25868771147781242879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.752 × 10⁹⁷(98-digit number)
17526083975879247164…51737542295562485759
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,615 XPM·at block #6,826,557 · 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