1. #6,806,622TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #516,022

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2014, 3:15:35 AM · Difficulty 10.8443 · 6,290,601 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
34839ae803bacc9faa85cdad7dcb4235b0899b5012e15170240bb4a7348b79f6

Height

#516,022

Difficulty

10.844341

Transactions

14

Size

23.81 KB

Version

2

Bits

0ad826b9

Nonce

123,781,956

Timestamp

4/29/2014, 3:15:35 AM

Confirmations

6,290,601

Merkle Root

03ad61034fc261a9439fd408bb5f1b893ab4688d0629fc50b4deda0dfecc6fb2
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.

2.095 × 10¹⁰¹(102-digit number)
20954470070167307786…08277978420666880001
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
2.095 × 10¹⁰¹(102-digit number)
20954470070167307786…08277978420666880001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.190 × 10¹⁰¹(102-digit number)
41908940140334615573…16555956841333760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.381 × 10¹⁰¹(102-digit number)
83817880280669231146…33111913682667520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.676 × 10¹⁰²(103-digit number)
16763576056133846229…66223827365335040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.352 × 10¹⁰²(103-digit number)
33527152112267692458…32447654730670080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.705 × 10¹⁰²(103-digit number)
67054304224535384917…64895309461340160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.341 × 10¹⁰³(104-digit number)
13410860844907076983…29790618922680320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.682 × 10¹⁰³(104-digit number)
26821721689814153966…59581237845360640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.364 × 10¹⁰³(104-digit number)
53643443379628307933…19162475690721280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.072 × 10¹⁰⁴(105-digit number)
10728688675925661586…38324951381442560001
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,697,085 XPM·at block #6,806,622 · 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