1. #6,825,696TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #554,961

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/21/2014, 5:57:26 AM · Difficulty 10.9627 · 6,270,736 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
82a8f2361c27b0d99981a6286c65337f105f8042ed35f04d04c3df381de52ee4

Height

#554,961

Difficulty

10.962697

Transactions

6

Size

2.03 KB

Version

2

Bits

0af67357

Nonce

812,283,949

Timestamp

5/21/2014, 5:57:26 AM

Confirmations

6,270,736

Merkle Root

121f75c6540e0e1312cf79ed8f7187b68e8f9b5c3caf5b6783eadff87cf126e3
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.259 × 10⁹⁸(99-digit number)
52598351941156954618…74061597481945171761
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.259 × 10⁹⁸(99-digit number)
52598351941156954618…74061597481945171761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.051 × 10⁹⁹(100-digit number)
10519670388231390923…48123194963890343521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.103 × 10⁹⁹(100-digit number)
21039340776462781847…96246389927780687041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.207 × 10⁹⁹(100-digit number)
42078681552925563695…92492779855561374081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.415 × 10⁹⁹(100-digit number)
84157363105851127390…84985559711122748161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.683 × 10¹⁰⁰(101-digit number)
16831472621170225478…69971119422245496321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.366 × 10¹⁰⁰(101-digit number)
33662945242340450956…39942238844490992641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.732 × 10¹⁰⁰(101-digit number)
67325890484680901912…79884477688981985281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.346 × 10¹⁰¹(102-digit number)
13465178096936180382…59768955377963970561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.693 × 10¹⁰¹(102-digit number)
26930356193872360764…19537910755927941121
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,849,688 XPM·at block #6,825,696 · 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