1. #6,809,630TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #400,956

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/12/2014, 10:55:00 AM · Difficulty 10.4306 · 6,408,675 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b378cb6209997973ceae31597983cf8b113ef338b4ea45c63559103e469bbbe0

Height

#400,956

Difficulty

10.430648

Transactions

9

Size

1.96 KB

Version

2

Bits

0a6e3ef1

Nonce

118,717

Timestamp

2/12/2014, 10:55:00 AM

Confirmations

6,408,675

Merkle Root

d4ccb517e0c72e2f5a28ef5f38610ede4d5e8bd64653f8af5a9c721279831543
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.759 × 10⁹⁶(97-digit number)
57591257370568417070…49901759165295603199
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.759 × 10⁹⁶(97-digit number)
57591257370568417070…49901759165295603199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.151 × 10⁹⁷(98-digit number)
11518251474113683414…99803518330591206399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.303 × 10⁹⁷(98-digit number)
23036502948227366828…99607036661182412799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.607 × 10⁹⁷(98-digit number)
46073005896454733656…99214073322364825599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.214 × 10⁹⁷(98-digit number)
92146011792909467312…98428146644729651199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.842 × 10⁹⁸(99-digit number)
18429202358581893462…96856293289459302399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.685 × 10⁹⁸(99-digit number)
36858404717163786924…93712586578918604799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.371 × 10⁹⁸(99-digit number)
73716809434327573849…87425173157837209599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.474 × 10⁹⁹(100-digit number)
14743361886865514769…74850346315674419199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.948 × 10⁹⁹(100-digit number)
29486723773731029539…49700692631348838399
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,721,126 XPM·at block #6,809,630 · 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