1. #6,825,620TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

  2. #6,825,619TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #1,851,965

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/16/2016, 6:04:45 PM · Difficulty 10.6332 · 4,973,656 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9c60b831ea7be38da2b9c9567296f519c8e574ebaf855aecf0e086c7425cf1d7

Height

#1,851,965

Difficulty

10.633204

Transactions

2

Size

1.28 KB

Version

2

Bits

0aa219ac

Nonce

383,338,939

Timestamp

11/16/2016, 6:04:45 PM

Confirmations

4,973,656

Merkle Root

b1302116b1954c64d90121a5ece09438831588f652fc9fd007cc81184c0fad45
Transactions (2)
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.

8.755 × 10⁹²(93-digit number)
87552470151577517300…24862083579508623359
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
8.755 × 10⁹²(93-digit number)
87552470151577517300…24862083579508623359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.751 × 10⁹³(94-digit number)
17510494030315503460…49724167159017246719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.502 × 10⁹³(94-digit number)
35020988060631006920…99448334318034493439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.004 × 10⁹³(94-digit number)
70041976121262013840…98896668636068986879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.400 × 10⁹⁴(95-digit number)
14008395224252402768…97793337272137973759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.801 × 10⁹⁴(95-digit number)
28016790448504805536…95586674544275947519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.603 × 10⁹⁴(95-digit number)
56033580897009611072…91173349088551895039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.120 × 10⁹⁵(96-digit number)
11206716179401922214…82346698177103790079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.241 × 10⁹⁵(96-digit number)
22413432358803844429…64693396354207580159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.482 × 10⁹⁵(96-digit number)
44826864717607688858…29386792708415160319
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,849,070 XPM·at block #6,825,620 · 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