1. #6,816,447TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #656,547

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/31/2014, 3:02:24 PM · Difficulty 10.9560 · 6,159,901 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
57c4d848ce48f96ca482d590ed9fb17b76a01f3a90ca2628a40ff07e586999c3

Height

#656,547

Difficulty

10.956041

Transactions

7

Size

3.81 KB

Version

2

Bits

0af4bf1c

Nonce

979,892,918

Timestamp

7/31/2014, 3:02:24 PM

Confirmations

6,159,901

Merkle Root

09a8caaae448384d1e8bba076caf2654b85ab98f7a8ae5eeb46783758a49e505
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.051 × 10⁹⁵(96-digit number)
60512979743168211469…43013612356516736001
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.051 × 10⁹⁵(96-digit number)
60512979743168211469…43013612356516736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.210 × 10⁹⁶(97-digit number)
12102595948633642293…86027224713033472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.420 × 10⁹⁶(97-digit number)
24205191897267284587…72054449426066944001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.841 × 10⁹⁶(97-digit number)
48410383794534569175…44108898852133888001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.682 × 10⁹⁶(97-digit number)
96820767589069138350…88217797704267776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.936 × 10⁹⁷(98-digit number)
19364153517813827670…76435595408535552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.872 × 10⁹⁷(98-digit number)
38728307035627655340…52871190817071104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.745 × 10⁹⁷(98-digit number)
77456614071255310680…05742381634142208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.549 × 10⁹⁸(99-digit number)
15491322814251062136…11484763268284416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.098 × 10⁹⁸(99-digit number)
30982645628502124272…22969526536568832001
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,775,710 XPM·at block #6,816,447 · 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