1. #6,812,350TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #343,640

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2014, 7:25:58 PM · Difficulty 10.1826 · 6,468,711 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fde6ab46e519dd2282a5b726c336d07f99d4f4247668371648b32383629117a5

Height

#343,640

Difficulty

10.182601

Transactions

3

Size

2.19 KB

Version

2

Bits

0a2ebee9

Nonce

36,176

Timestamp

1/4/2014, 7:25:58 PM

Confirmations

6,468,711

Merkle Root

038427a4a0fd0dc3bdf301165a1a6bccba50d26374c2f5e3d91c1f3a72942d88
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.

5.046 × 10⁹⁵(96-digit number)
50469301087948962182…05303084198184198401
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
5.046 × 10⁹⁵(96-digit number)
50469301087948962182…05303084198184198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.009 × 10⁹⁶(97-digit number)
10093860217589792436…10606168396368396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.018 × 10⁹⁶(97-digit number)
20187720435179584872…21212336792736793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.037 × 10⁹⁶(97-digit number)
40375440870359169745…42424673585473587201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.075 × 10⁹⁶(97-digit number)
80750881740718339491…84849347170947174401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.615 × 10⁹⁷(98-digit number)
16150176348143667898…69698694341894348801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.230 × 10⁹⁷(98-digit number)
32300352696287335796…39397388683788697601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.460 × 10⁹⁷(98-digit number)
64600705392574671592…78794777367577395201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.292 × 10⁹⁸(99-digit number)
12920141078514934318…57589554735154790401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.584 × 10⁹⁸(99-digit number)
25840282157029868637…15179109470309580801
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,742,829 XPM·at block #6,812,350 · 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