1. #6,816,701TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #309,883

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2013, 7:37:33 PM · Difficulty 9.9950 · 6,506,819 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6ce2ba112a5501266b9d1ee2ed1f3d5e25239ded7be8ed7a4b65aa72de32bba5

Height

#309,883

Difficulty

9.994990

Transactions

1

Size

1.08 KB

Version

2

Bits

09feb7b1

Nonce

89,599

Timestamp

12/13/2013, 7:37:33 PM

Confirmations

6,506,819

Merkle Root

257444055c88f607bf8a493ca1925ab063f47ea52eebedd88232b4b80718553d
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.287 × 10⁹⁴(95-digit number)
12877275829231950225…90643058792400790401
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.287 × 10⁹⁴(95-digit number)
12877275829231950225…90643058792400790401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.575 × 10⁹⁴(95-digit number)
25754551658463900451…81286117584801580801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.150 × 10⁹⁴(95-digit number)
51509103316927800902…62572235169603161601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.030 × 10⁹⁵(96-digit number)
10301820663385560180…25144470339206323201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.060 × 10⁹⁵(96-digit number)
20603641326771120360…50288940678412646401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.120 × 10⁹⁵(96-digit number)
41207282653542240721…00577881356825292801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.241 × 10⁹⁵(96-digit number)
82414565307084481443…01155762713650585601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.648 × 10⁹⁶(97-digit number)
16482913061416896288…02311525427301171201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.296 × 10⁹⁶(97-digit number)
32965826122833792577…04623050854602342401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.593 × 10⁹⁶(97-digit number)
65931652245667585154…09246101709204684801
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,777,738 XPM·at block #6,816,701 · 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