1. #6,833,506TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #840,572

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2014, 6:18:21 AM · Difficulty 10.9742 · 5,992,935 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fe17b58f75d219a2d1b82e314dc0fe35d8d32507d6fcd3910aa7c1f05444db0e

Height

#840,572

Difficulty

10.974217

Transactions

2

Size

425 B

Version

2

Bits

0af96642

Nonce

10,532,749

Timestamp

12/5/2014, 6:18:21 AM

Confirmations

5,992,935

Merkle Root

fc750364889df5ae2b5869543b50b3d45aeadb0ad3a60d35ddda37f0ce7178f9
Transactions (2)
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.623 × 10⁹⁴(95-digit number)
16237273448515107237…55665954135103411199
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.623 × 10⁹⁴(95-digit number)
16237273448515107237…55665954135103411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.247 × 10⁹⁴(95-digit number)
32474546897030214475…11331908270206822399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.494 × 10⁹⁴(95-digit number)
64949093794060428951…22663816540413644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.298 × 10⁹⁵(96-digit number)
12989818758812085790…45327633080827289599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.597 × 10⁹⁵(96-digit number)
25979637517624171580…90655266161654579199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.195 × 10⁹⁵(96-digit number)
51959275035248343160…81310532323309158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.039 × 10⁹⁶(97-digit number)
10391855007049668632…62621064646618316799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.078 × 10⁹⁶(97-digit number)
20783710014099337264…25242129293236633599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.156 × 10⁹⁶(97-digit number)
41567420028198674528…50484258586473267199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.313 × 10⁹⁶(97-digit number)
83134840056397349057…00968517172946534399
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,912,253 XPM·at block #6,833,506 · 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