1. #6,843,453TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

  2. #6,843,4522CC10 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #220,627

2CCLength 9★☆☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/21/2013, 3:13:45 AM · Difficulty 9.9369 · 6,622,827 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f1efb38e30624fcfa2f3b5ddb989d9c793262bde16141dcaa74fad49ff882fd8

Height

#220,627

Difficulty

9.936902

Transactions

1

Size

1.31 KB

Version

2

Bits

09efd8d5

Nonce

39,564

Timestamp

10/21/2013, 3:13:45 AM

Confirmations

6,622,827

Merkle Root

5d9c6bdc1d991bb599e2a32b610aa231e276f61891354a573582553778d7864f
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.923 × 10⁹¹(92-digit number)
59235830461331908328…64892976134747514481
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.923 × 10⁹¹(92-digit number)
59235830461331908328…64892976134747514481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.184 × 10⁹²(93-digit number)
11847166092266381665…29785952269495028961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.369 × 10⁹²(93-digit number)
23694332184532763331…59571904538990057921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.738 × 10⁹²(93-digit number)
47388664369065526663…19143809077980115841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.477 × 10⁹²(93-digit number)
94777328738131053326…38287618155960231681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.895 × 10⁹³(94-digit number)
18955465747626210665…76575236311920463361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.791 × 10⁹³(94-digit number)
37910931495252421330…53150472623840926721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.582 × 10⁹³(94-digit number)
75821862990504842660…06300945247681853441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.516 × 10⁹⁴(95-digit number)
15164372598100968532…12601890495363706881
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 9 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
CommonChain length 9

Found in most blocks. The baseline for Primecoin's proof-of-work.

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,992,000 XPM·at block #6,843,453 · 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