1. #6,809,251TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #262,170

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/16/2013, 1:42:16 PM · Difficulty 9.9696 · 6,547,082 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
27b5b7f6e89ec6672dcaf0edd17fd811270c99b2161dd5edab1fcca39ff2d01f

Height

#262,170

Difficulty

9.969560

Transactions

1

Size

1.91 KB

Version

2

Bits

09f8350e

Nonce

169,535

Timestamp

11/16/2013, 1:42:16 PM

Confirmations

6,547,082

Merkle Root

9aaee64aafa820b63adbf416593e5e0d3c36c41eb813f70af99aa48b0e951699
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.

6.963 × 10⁹⁵(96-digit number)
69631658888373419170…41129025844188373439
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
6.963 × 10⁹⁵(96-digit number)
69631658888373419170…41129025844188373439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.392 × 10⁹⁶(97-digit number)
13926331777674683834…82258051688376746879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.785 × 10⁹⁶(97-digit number)
27852663555349367668…64516103376753493759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.570 × 10⁹⁶(97-digit number)
55705327110698735336…29032206753506987519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.114 × 10⁹⁷(98-digit number)
11141065422139747067…58064413507013975039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.228 × 10⁹⁷(98-digit number)
22282130844279494134…16128827014027950079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.456 × 10⁹⁷(98-digit number)
44564261688558988269…32257654028055900159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.912 × 10⁹⁷(98-digit number)
89128523377117976538…64515308056111800319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.782 × 10⁹⁸(99-digit number)
17825704675423595307…29030616112223600639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.565 × 10⁹⁸(99-digit number)
35651409350847190615…58061232224447201279
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,718,082 XPM·at block #6,809,251 · 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