1. #6,810,770TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #1,241,733

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/18/2015, 5:29:40 AM · Difficulty 10.7556 · 5,569,038 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
174c5bece8039d1a9d2d835329ccb5cb11b6da579767d22237a3146b0e2bf00b

Height

#1,241,733

Difficulty

10.755618

Transactions

2

Size

434 B

Version

2

Bits

0ac17031

Nonce

1,855,368,847

Timestamp

9/18/2015, 5:29:40 AM

Confirmations

5,569,038

Merkle Root

b75fd401078afdd6b0974841cfdf3adce189be38d3ed5886bd2b9c6898535c50
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.

5.888 × 10⁹⁷(98-digit number)
58880439860650888150…33103826164424622079
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.888 × 10⁹⁷(98-digit number)
58880439860650888150…33103826164424622079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.177 × 10⁹⁸(99-digit number)
11776087972130177630…66207652328849244159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.355 × 10⁹⁸(99-digit number)
23552175944260355260…32415304657698488319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.710 × 10⁹⁸(99-digit number)
47104351888520710520…64830609315396976639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.420 × 10⁹⁸(99-digit number)
94208703777041421040…29661218630793953279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.884 × 10⁹⁹(100-digit number)
18841740755408284208…59322437261587906559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.768 × 10⁹⁹(100-digit number)
37683481510816568416…18644874523175813119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.536 × 10⁹⁹(100-digit number)
75366963021633136832…37289749046351626239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.507 × 10¹⁰⁰(101-digit number)
15073392604326627366…74579498092703252479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.014 × 10¹⁰⁰(101-digit number)
30146785208653254732…49158996185406504959
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,730,263 XPM·at block #6,810,770 · 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