Block #3,476,280

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/15/2019, 2:09:40 AM · Difficulty 10.9791 · 3,365,657 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee1d3e34f8e82be5b8f398167e627d6277cc605bff85de1f1de19ff8b271199d

Height

#3,476,280

Difficulty

10.979073

Transactions

7

Size

5.99 KB

Version

2

Bits

0afaa484

Nonce

1,136,169,888

Timestamp

12/15/2019, 2:09:40 AM

Confirmations

3,365,657

Merkle Root

9c54d38213db7edf5928a8d6092e77eec7f8377f3b97d42486d6581d20555821
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.

4.556 × 10⁹⁴(95-digit number)
45561848996596266984…10138558076806113279
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
4.556 × 10⁹⁴(95-digit number)
45561848996596266984…10138558076806113279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.112 × 10⁹⁴(95-digit number)
91123697993192533968…20277116153612226559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.822 × 10⁹⁵(96-digit number)
18224739598638506793…40554232307224453119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.644 × 10⁹⁵(96-digit number)
36449479197277013587…81108464614448906239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.289 × 10⁹⁵(96-digit number)
72898958394554027174…62216929228897812479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.457 × 10⁹⁶(97-digit number)
14579791678910805434…24433858457795624959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.915 × 10⁹⁶(97-digit number)
29159583357821610869…48867716915591249919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.831 × 10⁹⁶(97-digit number)
58319166715643221739…97735433831182499839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.166 × 10⁹⁷(98-digit number)
11663833343128644347…95470867662364999679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.332 × 10⁹⁷(98-digit number)
23327666686257288695…90941735324729999359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.665 × 10⁹⁷(98-digit number)
46655333372514577391…81883470649459998719
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,979,876 XPM·at block #6,841,936 · 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