1. #6,810,368TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #386,614

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/2/2014, 1:55:13 PM · Difficulty 10.4113 · 6,423,755 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cec0d092b59965f06ab13c0e04ce0f1c9adf3fd33ed82f38f253c02bf1737df2

Height

#386,614

Difficulty

10.411276

Transactions

9

Size

2.72 KB

Version

2

Bits

0a69495f

Nonce

126,055

Timestamp

2/2/2014, 1:55:13 PM

Confirmations

6,423,755

Merkle Root

95ec9054e3be3c2d5dd1709c891a396b8ececac013278547d79284335a8f2924
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.939 × 10⁹⁴(95-digit number)
59394097100835312574…01269180639009283839
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.939 × 10⁹⁴(95-digit number)
59394097100835312574…01269180639009283839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.187 × 10⁹⁵(96-digit number)
11878819420167062514…02538361278018567679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.375 × 10⁹⁵(96-digit number)
23757638840334125029…05076722556037135359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.751 × 10⁹⁵(96-digit number)
47515277680668250059…10153445112074270719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.503 × 10⁹⁵(96-digit number)
95030555361336500118…20306890224148541439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.900 × 10⁹⁶(97-digit number)
19006111072267300023…40613780448297082879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.801 × 10⁹⁶(97-digit number)
38012222144534600047…81227560896594165759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.602 × 10⁹⁶(97-digit number)
76024444289069200094…62455121793188331519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.520 × 10⁹⁷(98-digit number)
15204888857813840018…24910243586376663039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.040 × 10⁹⁷(98-digit number)
30409777715627680037…49820487172753326079
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,727,028 XPM·at block #6,810,368 · 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