Block #3,506,301

TWNLength 10★★☆☆☆

Bi-Twin Chain · Discovered 1/9/2020, 5:37:10 AM · Difficulty 10.9305 · 3,320,621 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
0034f4466786c817b65ec0d7e5660067a05a8f57d073b01e4486abe8c20986c3

Height

#3,506,301

Difficulty

10.930475

Transactions

11

Size

72.89 KB

Version

2

Bits

0aee3399

Nonce

2,670,858

Timestamp

1/9/2020, 5:37:10 AM

Confirmations

3,320,621

Merkle Root

250a52576313734f561904e827a1e7a384da001dbb44ace485ca1b38d1599d05
Transactions (11)
1 in → 1 out9.1600 XPM110 B
50 in → 1 out65.1207 XPM7.27 KB
50 in → 1 out64.4934 XPM7.27 KB
50 in → 1 out61.7295 XPM7.27 KB
50 in → 1 out63.7282 XPM7.27 KB
50 in → 1 out59.4958 XPM7.26 KB
50 in → 1 out63.0291 XPM7.27 KB
50 in → 1 out61.0945 XPM7.27 KB
50 in → 1 out62.3114 XPM7.27 KB
50 in → 1 out60.3123 XPM7.27 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.

1.737 × 10⁹⁸(99-digit number)
17376776237966010548…43145606953249300479
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
1.737 × 10⁹⁸(99-digit number)
17376776237966010548…43145606953249300479
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.737 × 10⁹⁸(99-digit number)
17376776237966010548…43145606953249300481
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
3.475 × 10⁹⁸(99-digit number)
34753552475932021097…86291213906498600959
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
3.475 × 10⁹⁸(99-digit number)
34753552475932021097…86291213906498600961
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
6.950 × 10⁹⁸(99-digit number)
69507104951864042194…72582427812997201919
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
6.950 × 10⁹⁸(99-digit number)
69507104951864042194…72582427812997201921
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
1.390 × 10⁹⁹(100-digit number)
13901420990372808438…45164855625994403839
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.390 × 10⁹⁹(100-digit number)
13901420990372808438…45164855625994403841
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
2.780 × 10⁹⁹(100-digit number)
27802841980745616877…90329711251988807679
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
2.780 × 10⁹⁹(100-digit number)
27802841980745616877…90329711251988807681
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,859,547 XPM·at block #6,826,921 · 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