1. #6,809,118TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #552,681

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/19/2014, 3:37:42 PM · Difficulty 10.9628 · 6,256,438 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7e910ee9c7581204ca6d646fc591b847a70087338a6265d232004490f278b68c

Height

#552,681

Difficulty

10.962788

Transactions

2

Size

1.11 KB

Version

2

Bits

0af6793e

Nonce

521,690

Timestamp

5/19/2014, 3:37:42 PM

Confirmations

6,256,438

Merkle Root

8324135e4a1faa7654ecff6ebd7f70c3a458666b1bd0471a18ec7eafee7e06cc
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.

3.021 × 10⁹⁰(91-digit number)
30211318490847910808…14664369301806924001
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
3.021 × 10⁹⁰(91-digit number)
30211318490847910808…14664369301806924001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.042 × 10⁹⁰(91-digit number)
60422636981695821617…29328738603613848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.208 × 10⁹¹(92-digit number)
12084527396339164323…58657477207227696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.416 × 10⁹¹(92-digit number)
24169054792678328647…17314954414455392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.833 × 10⁹¹(92-digit number)
48338109585356657294…34629908828910784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.667 × 10⁹¹(92-digit number)
96676219170713314588…69259817657821568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.933 × 10⁹²(93-digit number)
19335243834142662917…38519635315643136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.867 × 10⁹²(93-digit number)
38670487668285325835…77039270631286272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.734 × 10⁹²(93-digit number)
77340975336570651670…54078541262572544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.546 × 10⁹³(94-digit number)
15468195067314130334…08157082525145088001
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,717,009 XPM·at block #6,809,118 · 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