1. #6,809,724TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #521,632

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2014, 1:54:23 PM · Difficulty 10.8635 · 6,288,093 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
47890dfa91270411d1c21d6400ed9feec439e71ba23c597144659017ea3cc803

Height

#521,632

Difficulty

10.863461

Transactions

2

Size

2.88 KB

Version

2

Bits

0add0bcc

Nonce

91,375,642

Timestamp

5/2/2014, 1:54:23 PM

Confirmations

6,288,093

Merkle Root

689bd920e823f1ea4d5f832a0ed87f606e381e8a42f9d0b9fe3dc30367d30bfb
Transactions (2)
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.516 × 10⁹⁹(100-digit number)
35167703779501549597…22887410487122590721
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.516 × 10⁹⁹(100-digit number)
35167703779501549597…22887410487122590721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.033 × 10⁹⁹(100-digit number)
70335407559003099195…45774820974245181441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.406 × 10¹⁰⁰(101-digit number)
14067081511800619839…91549641948490362881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.813 × 10¹⁰⁰(101-digit number)
28134163023601239678…83099283896980725761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.626 × 10¹⁰⁰(101-digit number)
56268326047202479356…66198567793961451521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.125 × 10¹⁰¹(102-digit number)
11253665209440495871…32397135587922903041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.250 × 10¹⁰¹(102-digit number)
22507330418880991742…64794271175845806081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.501 × 10¹⁰¹(102-digit number)
45014660837761983485…29588542351691612161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.002 × 10¹⁰¹(102-digit number)
90029321675523966970…59177084703383224321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.800 × 10¹⁰²(103-digit number)
18005864335104793394…18354169406766448641
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,721,881 XPM·at block #6,809,724 · 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