1. #6,809,475TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #1,545,266

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/17/2016, 9:06:27 AM · Difficulty 10.6580 · 5,264,210 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1a8d593fd52694fcc0d26c8aefebc3c43501289d1a60416e4a3b24748d07b045

Height

#1,545,266

Difficulty

10.658050

Transactions

31

Size

10.25 KB

Version

2

Bits

0aa875f3

Nonce

553,612,893

Timestamp

4/17/2016, 9:06:27 AM

Confirmations

5,264,210

Merkle Root

a48eb12906dbbd692fc1175e2caa4026a9ed9c5f4d57844c6469604dfe536091
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.288 × 10⁹⁷(98-digit number)
12889025753357032902…60102433459348067839
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.288 × 10⁹⁷(98-digit number)
12889025753357032902…60102433459348067839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.577 × 10⁹⁷(98-digit number)
25778051506714065804…20204866918696135679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.155 × 10⁹⁷(98-digit number)
51556103013428131608…40409733837392271359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.031 × 10⁹⁸(99-digit number)
10311220602685626321…80819467674784542719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.062 × 10⁹⁸(99-digit number)
20622441205371252643…61638935349569085439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.124 × 10⁹⁸(99-digit number)
41244882410742505286…23277870699138170879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.248 × 10⁹⁸(99-digit number)
82489764821485010573…46555741398276341759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.649 × 10⁹⁹(100-digit number)
16497952964297002114…93111482796552683519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.299 × 10⁹⁹(100-digit number)
32995905928594004229…86222965593105367039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.599 × 10⁹⁹(100-digit number)
65991811857188008458…72445931186210734079
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,719,880 XPM·at block #6,809,475 · 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