1. #6,814,040TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #320,583

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/19/2013, 6:16:06 PM · Difficulty 10.1840 · 6,493,458 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
db1f705dd989a260d83f162fab8222068cde3546d2cc459cf3df73bc4b5e8e7d

Height

#320,583

Difficulty

10.184047

Transactions

6

Size

12.72 KB

Version

2

Bits

0a2f1db7

Nonce

27,281

Timestamp

12/19/2013, 6:16:06 PM

Confirmations

6,493,458

Merkle Root

f2ddd55575cdf8148ef3936d26d13ed41f830b653a0d4023a2b5a4064042f02e
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.059 × 10⁹⁶(97-digit number)
80597082772784866767…10478035251188370999
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.059 × 10⁹⁶(97-digit number)
80597082772784866767…10478035251188370999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.611 × 10⁹⁷(98-digit number)
16119416554556973353…20956070502376741999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.223 × 10⁹⁷(98-digit number)
32238833109113946707…41912141004753483999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.447 × 10⁹⁷(98-digit number)
64477666218227893414…83824282009506967999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.289 × 10⁹⁸(99-digit number)
12895533243645578682…67648564019013935999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.579 × 10⁹⁸(99-digit number)
25791066487291157365…35297128038027871999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.158 × 10⁹⁸(99-digit number)
51582132974582314731…70594256076055743999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.031 × 10⁹⁹(100-digit number)
10316426594916462946…41188512152111487999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.063 × 10⁹⁹(100-digit number)
20632853189832925892…82377024304222975999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.126 × 10⁹⁹(100-digit number)
41265706379665851785…64754048608445951999
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,756,403 XPM·at block #6,814,040 · 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