1. #6,808,221TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #1,726,037

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2016, 1:12:28 PM · Difficulty 10.6985 · 5,082,185 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
71f83080557351a90e322d5c8de334b6f5b63c81b811ca4c62bd09ba169cbc42

Height

#1,726,037

Difficulty

10.698492

Transactions

1

Size

242 B

Version

2

Bits

0ab2d064

Nonce

144,162,521

Timestamp

8/20/2016, 1:12:28 PM

Confirmations

5,082,185

Merkle Root

4ede3dca19afbef4ab74c3d8c89135ac192c144a235e17f26a531e1b6f4f4c08
Transactions (1)
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.

7.025 × 10⁹⁵(96-digit number)
70251119971914299236…92933530355950743041
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
7.025 × 10⁹⁵(96-digit number)
70251119971914299236…92933530355950743041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.405 × 10⁹⁶(97-digit number)
14050223994382859847…85867060711901486081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.810 × 10⁹⁶(97-digit number)
28100447988765719694…71734121423802972161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.620 × 10⁹⁶(97-digit number)
56200895977531439388…43468242847605944321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.124 × 10⁹⁷(98-digit number)
11240179195506287877…86936485695211888641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.248 × 10⁹⁷(98-digit number)
22480358391012575755…73872971390423777281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.496 × 10⁹⁷(98-digit number)
44960716782025151511…47745942780847554561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.992 × 10⁹⁷(98-digit number)
89921433564050303022…95491885561695109121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.798 × 10⁹⁸(99-digit number)
17984286712810060604…90983771123390218241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.596 × 10⁹⁸(99-digit number)
35968573425620121208…81967542246780436481
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,709,828 XPM·at block #6,808,221 · 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