1. #6,806,619TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #283,622

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2013, 7:46:56 PM · Difficulty 9.9814 · 6,522,998 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a892ae1936f486fd21a7ca3184920bab9936040cd4c37cafad6e58ac69b29b81

Height

#283,622

Difficulty

9.981375

Transactions

11

Size

2.84 KB

Version

2

Bits

09fb3b67

Nonce

5,292

Timestamp

11/29/2013, 7:46:56 PM

Confirmations

6,522,998

Merkle Root

e366e0308df272be7a5f628a6d1209738870c63775864fdff36ff004259151ca
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.501 × 10⁹³(94-digit number)
25012301585768695608…61917369193163601921
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.501 × 10⁹³(94-digit number)
25012301585768695608…61917369193163601921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.002 × 10⁹³(94-digit number)
50024603171537391217…23834738386327203841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.000 × 10⁹⁴(95-digit number)
10004920634307478243…47669476772654407681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.000 × 10⁹⁴(95-digit number)
20009841268614956487…95338953545308815361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.001 × 10⁹⁴(95-digit number)
40019682537229912974…90677907090617630721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.003 × 10⁹⁴(95-digit number)
80039365074459825948…81355814181235261441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.600 × 10⁹⁵(96-digit number)
16007873014891965189…62711628362470522881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.201 × 10⁹⁵(96-digit number)
32015746029783930379…25423256724941045761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.403 × 10⁹⁵(96-digit number)
64031492059567860759…50846513449882091521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.280 × 10⁹⁶(97-digit number)
12806298411913572151…01693026899764183041
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,060 XPM·at block #6,806,619 · 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