1. #6,839,9072CC10 primes

    Cunningham 2nd · ⛏️ coinsforall.io

  2. #6,839,9061CC11 primes

    Cunningham 1st · ⛏️ coinsforall.io

  3. #6,839,905TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

  4. #6,839,9041CC10 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #2,813,137

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 8/28/2018, 2:22:45 AM · Difficulty 11.6765 · 4,026,771 confirmations

TWN
Bi-Twin Chain

Interleaved pairs of primes that differ by 2, forming twin prime pairs at each level.

Block Header
Block Hash
a505eb70b7a096271fbdfdbd2bb339082d20eee46a6cdc4835bdc22dc1f0d316

Height

#2,813,137

Difficulty

11.676470

Transactions

43

Size

11.90 KB

Version

2

Bits

0bad2d22

Nonce

1,898,708,705

Timestamp

8/28/2018, 2:22:45 AM

Confirmations

4,026,771

Merkle Root

2a173f84a047d9cebea3fd9577a9cdbcea13a47070fbc9a08247afd39ebe7c14
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.802 × 10⁹⁸(99-digit number)
28021304718844205579…16488038518090629119
Discovered Prime Numbers
Lower: 2^k × origin − 1 | Upper: 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.

Level 0 — Twin Prime Pair (origin ± 1)
origin − 1
2.802 × 10⁹⁸(99-digit number)
28021304718844205579…16488038518090629119
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
2.802 × 10⁹⁸(99-digit number)
28021304718844205579…16488038518090629121
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: origin + 1 − origin − 1 = 2 (twin primes ✓)
Level 1 — Twin Prime Pair (2^1 × origin ± 1)
2^1 × origin − 1
5.604 × 10⁹⁸(99-digit number)
56042609437688411159…32976077036181258239
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
5.604 × 10⁹⁸(99-digit number)
56042609437688411159…32976077036181258241
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^1 × origin + 1 − 2^1 × origin − 1 = 2 (twin primes ✓)
Level 2 — Twin Prime Pair (2^2 × origin ± 1)
2^2 × origin − 1
1.120 × 10⁹⁹(100-digit number)
11208521887537682231…65952154072362516479
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
1.120 × 10⁹⁹(100-digit number)
11208521887537682231…65952154072362516481
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^2 × origin + 1 − 2^2 × origin − 1 = 2 (twin primes ✓)
Level 3 — Twin Prime Pair (2^3 × origin ± 1)
2^3 × origin − 1
2.241 × 10⁹⁹(100-digit number)
22417043775075364463…31904308144725032959
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
2.241 × 10⁹⁹(100-digit number)
22417043775075364463…31904308144725032961
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^3 × origin + 1 − 2^3 × origin − 1 = 2 (twin primes ✓)
Level 4 — Twin Prime Pair (2^4 × origin ± 1)
2^4 × origin − 1
4.483 × 10⁹⁹(100-digit number)
44834087550150728927…63808616289450065919
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
4.483 × 10⁹⁹(100-digit number)
44834087550150728927…63808616289450065921
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^4 × origin + 1 − 2^4 × origin − 1 = 2 (twin primes ✓)
Level 5 — Twin Prime Pair (2^5 × origin ± 1)
2^5 × origin − 1
8.966 × 10⁹⁹(100-digit number)
89668175100301457855…27617232578900131839
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Bi-Twin Chain. 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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 TWN formula:

TWN: twin pairs (p, p+2) where p = origin/primorial − 1 and p+2 = origin/primorial + 1
Circulating Supply:57,963,563 XPM·at block #6,839,907 · 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