1. #6,833,733TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

  2. #6,833,7321CC11 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #1,849,216

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/14/2016, 10:49:00 PM · Difficulty 10.6215 · 4,984,518 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ae9e69f57b775157b1ece9f3da43c45dd0c33b511c0a2af072271732aaa35bea

Height

#1,849,216

Difficulty

10.621548

Transactions

1

Size

243 B

Version

2

Bits

0a9f1dbf

Nonce

53,092,402

Timestamp

11/14/2016, 10:49:00 PM

Confirmations

4,984,518

Merkle Root

80396c1a6273c52682176e83179216b8f331cb907ecfedf707270dcb5207d647
Transactions (1)
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.091 × 10⁹⁶(97-digit number)
30913135442555807744…95937737639672480001
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.091 × 10⁹⁶(97-digit number)
30913135442555807744…95937737639672480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.182 × 10⁹⁶(97-digit number)
61826270885111615489…91875475279344960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.236 × 10⁹⁷(98-digit number)
12365254177022323097…83750950558689920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.473 × 10⁹⁷(98-digit number)
24730508354044646195…67501901117379840001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.946 × 10⁹⁷(98-digit number)
49461016708089292391…35003802234759680001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.892 × 10⁹⁷(98-digit number)
98922033416178584783…70007604469519360001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.978 × 10⁹⁸(99-digit number)
19784406683235716956…40015208939038720001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.956 × 10⁹⁸(99-digit number)
39568813366471433913…80030417878077440001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.913 × 10⁹⁸(99-digit number)
79137626732942867826…60060835756154880001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.582 × 10⁹⁹(100-digit number)
15827525346588573565…20121671512309760001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,914,096 XPM·at block #6,833,733 · 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