Block #3,355,922

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/15/2019, 1:06:07 PM · Difficulty 10.9960 · 3,471,125 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
93081d600696af77266c9c60971f8c1f495ec7947beb90b0982885527c1883d5

Height

#3,355,922

Difficulty

10.995997

Transactions

26

Size

8.51 KB

Version

2

Bits

0afef9a3

Nonce

1,859,179,175

Timestamp

9/15/2019, 1:06:07 PM

Confirmations

3,471,125

Merkle Root

0a431a383469d27e400faf878321f90961d6a049d9f0d103eec2027ee6bef5ca
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.237 × 10⁹⁵(96-digit number)
22372150962763344615…18176762585209292799
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.237 × 10⁹⁵(96-digit number)
22372150962763344615…18176762585209292799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.474 × 10⁹⁵(96-digit number)
44744301925526689230…36353525170418585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.948 × 10⁹⁵(96-digit number)
89488603851053378461…72707050340837171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.789 × 10⁹⁶(97-digit number)
17897720770210675692…45414100681674342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.579 × 10⁹⁶(97-digit number)
35795441540421351384…90828201363348684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.159 × 10⁹⁶(97-digit number)
71590883080842702768…81656402726697369599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.431 × 10⁹⁷(98-digit number)
14318176616168540553…63312805453394739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.863 × 10⁹⁷(98-digit number)
28636353232337081107…26625610906789478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.727 × 10⁹⁷(98-digit number)
57272706464674162215…53251221813578956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.145 × 10⁹⁸(99-digit number)
11454541292934832443…06502443627157913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.290 × 10⁹⁸(99-digit number)
22909082585869664886…13004887254315827199
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,860,557 XPM·at block #6,827,046 · 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