1. #6,808,706TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #379,373

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/28/2014, 12:10:52 PM · Difficulty 10.4163 · 6,429,334 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
15a36c3cbd02085bb65680293cb6e7032f9b7cf9b457faf43f28395477c1d49e

Height

#379,373

Difficulty

10.416338

Transactions

7

Size

2.10 KB

Version

2

Bits

0a6a9522

Nonce

462,699

Timestamp

1/28/2014, 12:10:52 PM

Confirmations

6,429,334

Merkle Root

9917e9dcae529665b67e6e54ca3c205148bc79100a4f892983ef4ceaa8b638b8
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.

1.430 × 10⁹²(93-digit number)
14301566560897387504…31642323605824082799
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
1.430 × 10⁹²(93-digit number)
14301566560897387504…31642323605824082799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.860 × 10⁹²(93-digit number)
28603133121794775009…63284647211648165599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.720 × 10⁹²(93-digit number)
57206266243589550019…26569294423296331199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.144 × 10⁹³(94-digit number)
11441253248717910003…53138588846592662399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.288 × 10⁹³(94-digit number)
22882506497435820007…06277177693185324799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.576 × 10⁹³(94-digit number)
45765012994871640015…12554355386370649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.153 × 10⁹³(94-digit number)
91530025989743280031…25108710772741299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.830 × 10⁹⁴(95-digit number)
18306005197948656006…50217421545482598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.661 × 10⁹⁴(95-digit number)
36612010395897312012…00434843090965196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.322 × 10⁹⁴(95-digit number)
73224020791794624025…00869686181930393599
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,713,707 XPM·at block #6,808,706 · 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