Block #3,506,096

TWNLength 10★★☆☆☆

Bi-Twin Chain · Discovered 1/9/2020, 2:19:05 AM · Difficulty 10.9304 · 3,330,421 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
40676a06944d71a7eff12ef6b0c685d606b229fda0def9152567e419c54cd845

Height

#3,506,096

Difficulty

10.930395

Transactions

11

Size

72.88 KB

Version

2

Bits

0aee2e5e

Nonce

1,137,418,162

Timestamp

1/9/2020, 2:19:05 AM

Confirmations

3,330,421

Merkle Root

073fdbb343b0dbbf8318e7530899db429a9c352ca2512f0db31c53f04a514235
Transactions (11)
1 in → 1 out9.1600 XPM109 B
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.26 KB
50 in → 1 out199.9200 XPM7.26 KB
50 in → 1 out199.9200 XPM7.26 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.28 KB
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.

7.777 × 10⁹⁵(96-digit number)
77770926894050258047…93219565113680939519
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
7.777 × 10⁹⁵(96-digit number)
77770926894050258047…93219565113680939519
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
7.777 × 10⁹⁵(96-digit number)
77770926894050258047…93219565113680939521
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
1.555 × 10⁹⁶(97-digit number)
15554185378810051609…86439130227361879039
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.555 × 10⁹⁶(97-digit number)
15554185378810051609…86439130227361879041
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
3.110 × 10⁹⁶(97-digit number)
31108370757620103219…72878260454723758079
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
3.110 × 10⁹⁶(97-digit number)
31108370757620103219…72878260454723758081
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
6.221 × 10⁹⁶(97-digit number)
62216741515240206438…45756520909447516159
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
6.221 × 10⁹⁶(97-digit number)
62216741515240206438…45756520909447516161
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
1.244 × 10⁹⁷(98-digit number)
12443348303048041287…91513041818895032319
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.244 × 10⁹⁷(98-digit number)
12443348303048041287…91513041818895032321
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^4 × origin + 1 − 2^4 × origin − 1 = 2 (twin primes ✓)

What this block proved

The miner who found this block proved the existence of 10 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
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 TWN formula:

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