1. #6,817,825TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #537,112

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/11/2014, 5:15:52 PM · Difficulty 10.9144 · 6,280,714 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3dc0e3bdf67a23633cfd4693297c9e036289b847e522d4bb6192d68b021cb1c6

Height

#537,112

Difficulty

10.914363

Transactions

8

Size

2.53 KB

Version

2

Bits

0aea13b9

Nonce

52,834,903

Timestamp

5/11/2014, 5:15:52 PM

Confirmations

6,280,714

Merkle Root

c534804526eb771705993d356383018970b55ba93a54e9d2e59697dcc87072f2
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.396 × 10⁹⁸(99-digit number)
23963480670272573033…58225262400494564001
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.396 × 10⁹⁸(99-digit number)
23963480670272573033…58225262400494564001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.792 × 10⁹⁸(99-digit number)
47926961340545146066…16450524800989128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.585 × 10⁹⁸(99-digit number)
95853922681090292133…32901049601978256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.917 × 10⁹⁹(100-digit number)
19170784536218058426…65802099203956512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.834 × 10⁹⁹(100-digit number)
38341569072436116853…31604198407913024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.668 × 10⁹⁹(100-digit number)
76683138144872233706…63208396815826048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.533 × 10¹⁰⁰(101-digit number)
15336627628974446741…26416793631652096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.067 × 10¹⁰⁰(101-digit number)
30673255257948893482…52833587263304192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.134 × 10¹⁰⁰(101-digit number)
61346510515897786965…05667174526608384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.226 × 10¹⁰¹(102-digit number)
12269302103179557393…11334349053216768001
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,786,672 XPM·at block #6,817,825 · 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