1. #6,810,223TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #322,450

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/21/2013, 12:23:49 AM · Difficulty 10.1944 · 6,487,774 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
53e925b330c79e86bd2e7153b14289b004c3a294f52a32d1641b0795e5347d94

Height

#322,450

Difficulty

10.194382

Transactions

19

Size

8.80 KB

Version

2

Bits

0a31c2fe

Nonce

107,343

Timestamp

12/21/2013, 12:23:49 AM

Confirmations

6,487,774

Merkle Root

74eddc393d9c2540ea48d615ca392b66ccd4754849f0addb69adcf2cd6bfee84
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.273 × 10⁹⁷(98-digit number)
32739236049865963073…83372940820705232719
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.273 × 10⁹⁷(98-digit number)
32739236049865963073…83372940820705232719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.547 × 10⁹⁷(98-digit number)
65478472099731926146…66745881641410465439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.309 × 10⁹⁸(99-digit number)
13095694419946385229…33491763282820930879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.619 × 10⁹⁸(99-digit number)
26191388839892770458…66983526565641861759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.238 × 10⁹⁸(99-digit number)
52382777679785540917…33967053131283723519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.047 × 10⁹⁹(100-digit number)
10476555535957108183…67934106262567447039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.095 × 10⁹⁹(100-digit number)
20953111071914216366…35868212525134894079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.190 × 10⁹⁹(100-digit number)
41906222143828432733…71736425050269788159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.381 × 10⁹⁹(100-digit number)
83812444287656865467…43472850100539576319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.676 × 10¹⁰⁰(101-digit number)
16762488857531373093…86945700201079152639
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,725,868 XPM·at block #6,810,223 · 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.

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