1. #6,806,705TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #369,562

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/21/2014, 11:57:54 AM · Difficulty 10.4455 · 6,437,144 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
96984ad524af21c72a8fac5b86241b9b52b36c93d7bb5de825c7506718f2978a

Height

#369,562

Difficulty

10.445548

Transactions

13

Size

3.93 KB

Version

2

Bits

0a720f6b

Nonce

58,730

Timestamp

1/21/2014, 11:57:54 AM

Confirmations

6,437,144

Merkle Root

19f035ee2153a5fd4d20375664964af5b1883d6fbdce4bcec2a4992064074380
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.

6.555 × 10⁹⁶(97-digit number)
65551700869615546352…80048770193900317519
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
6.555 × 10⁹⁶(97-digit number)
65551700869615546352…80048770193900317519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.311 × 10⁹⁷(98-digit number)
13110340173923109270…60097540387800635039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.622 × 10⁹⁷(98-digit number)
26220680347846218540…20195080775601270079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.244 × 10⁹⁷(98-digit number)
52441360695692437081…40390161551202540159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.048 × 10⁹⁸(99-digit number)
10488272139138487416…80780323102405080319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.097 × 10⁹⁸(99-digit number)
20976544278276974832…61560646204810160639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.195 × 10⁹⁸(99-digit number)
41953088556553949665…23121292409620321279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.390 × 10⁹⁸(99-digit number)
83906177113107899330…46242584819240642559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.678 × 10⁹⁹(100-digit number)
16781235422621579866…92485169638481285119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.356 × 10⁹⁹(100-digit number)
33562470845243159732…84970339276962570239
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,697,745 XPM·at block #6,806,705 · 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