Block #2,639,748

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 4/30/2018, 6:28:39 PM · Difficulty 11.5515 · 4,191,136 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
4d72c39662c9cb304c5086331c239d0a1c5b03c9ac6b887087e3b56b9935e5ed

Height

#2,639,748

Difficulty

11.551469

Transactions

12

Size

2.57 KB

Version

2

Bits

0b8d2d0f

Nonce

692,202,513

Timestamp

4/30/2018, 6:28:39 PM

Confirmations

4,191,136

Merkle Root

522c09b291580b3af1d155c58561503a2402b20c75d462eead596b1978df3860
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.

3.092 × 10⁹⁸(99-digit number)
30927394340996117356…36593817551609692159
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
3.092 × 10⁹⁸(99-digit number)
30927394340996117356…36593817551609692159
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
3.092 × 10⁹⁸(99-digit number)
30927394340996117356…36593817551609692161
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
6.185 × 10⁹⁸(99-digit number)
61854788681992234712…73187635103219384319
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
6.185 × 10⁹⁸(99-digit number)
61854788681992234712…73187635103219384321
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.237 × 10⁹⁹(100-digit number)
12370957736398446942…46375270206438768639
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
1.237 × 10⁹⁹(100-digit number)
12370957736398446942…46375270206438768641
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.474 × 10⁹⁹(100-digit number)
24741915472796893885…92750540412877537279
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
2.474 × 10⁹⁹(100-digit number)
24741915472796893885…92750540412877537281
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.948 × 10⁹⁹(100-digit number)
49483830945593787770…85501080825755074559
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
4.948 × 10⁹⁹(100-digit number)
49483830945593787770…85501080825755074561
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
9.896 × 10⁹⁹(100-digit number)
98967661891187575540…71002161651510149119
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,891,208 XPM·at block #6,830,883 · 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