Block #3,025,804

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/26/2019, 4:25:31 AM · Difficulty 11.1602 · 3,808,050 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
8ec9836cb6f790fbded8ce2d873881e06ed6961acbf526411b8601ebafeac597

Height

#3,025,804

Difficulty

11.160167

Transactions

25

Size

7.51 KB

Version

2

Bits

0b2900ba

Nonce

67,554,798

Timestamp

1/26/2019, 4:25:31 AM

Confirmations

3,808,050

Merkle Root

10293a0bd5eb3ac3107411f005dd31f4b05ab28454cf2e38a780886c57abd79c
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.

4.163 × 10⁹⁸(99-digit number)
41639996388089773073…36736082977096990719
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
4.163 × 10⁹⁸(99-digit number)
41639996388089773073…36736082977096990719
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
4.163 × 10⁹⁸(99-digit number)
41639996388089773073…36736082977096990721
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
8.327 × 10⁹⁸(99-digit number)
83279992776179546146…73472165954193981439
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
8.327 × 10⁹⁸(99-digit number)
83279992776179546146…73472165954193981441
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.665 × 10⁹⁹(100-digit number)
16655998555235909229…46944331908387962879
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
1.665 × 10⁹⁹(100-digit number)
16655998555235909229…46944331908387962881
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
3.331 × 10⁹⁹(100-digit number)
33311997110471818458…93888663816775925759
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
3.331 × 10⁹⁹(100-digit number)
33311997110471818458…93888663816775925761
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
6.662 × 10⁹⁹(100-digit number)
66623994220943636917…87777327633551851519
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
6.662 × 10⁹⁹(100-digit number)
66623994220943636917…87777327633551851521
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
1.332 × 10¹⁰⁰(101-digit number)
13324798844188727383…75554655267103703039
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,915,063 XPM·at block #6,833,853 · 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