1. #6,808,044TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #315,951

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 7:15:13 PM · Difficulty 10.1198 · 6,492,094 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
97d7e985035be4bfbd1c49821e26c136ae4c47f70b47e6a3856006a071effa93

Height

#315,951

Difficulty

10.119830

Transactions

11

Size

8.81 KB

Version

2

Bits

0a1ead27

Nonce

8,659

Timestamp

12/16/2013, 7:15:13 PM

Confirmations

6,492,094

Merkle Root

6d9bb952a01dd3bdc12ccd367d04dfef89497c9edaee4afa2fadd722f0b4e1e4
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.

1.304 × 10⁹⁴(95-digit number)
13043699679451865477…13601737917744087041
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
1.304 × 10⁹⁴(95-digit number)
13043699679451865477…13601737917744087041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.608 × 10⁹⁴(95-digit number)
26087399358903730955…27203475835488174081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.217 × 10⁹⁴(95-digit number)
52174798717807461911…54406951670976348161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.043 × 10⁹⁵(96-digit number)
10434959743561492382…08813903341952696321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.086 × 10⁹⁵(96-digit number)
20869919487122984764…17627806683905392641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.173 × 10⁹⁵(96-digit number)
41739838974245969529…35255613367810785281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.347 × 10⁹⁵(96-digit number)
83479677948491939059…70511226735621570561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.669 × 10⁹⁶(97-digit number)
16695935589698387811…41022453471243141121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.339 × 10⁹⁶(97-digit number)
33391871179396775623…82044906942486282241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.678 × 10⁹⁶(97-digit number)
66783742358793551247…64089813884972564481
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,708,405 XPM·at block #6,808,044 · 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