Block #3,504,287

TWNLength 10★★☆☆☆

Bi-Twin Chain · Discovered 1/7/2020, 7:19:04 PM · Difficulty 10.9310 · 3,337,743 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
83404c03a64574a59ea73a9ce5d276f2d56571b918bca00d1778b7a529f0b7d0

Height

#3,504,287

Difficulty

10.931048

Transactions

23

Size

146.64 KB

Version

2

Bits

0aee592a

Nonce

201,449,775

Timestamp

1/7/2020, 7:19:04 PM

Confirmations

3,337,743

Merkle Root

09536407b731abbd117578d8dae8bf233269f9d3d9a949031c98ff60136fa3e8
Transactions (23)
1 in → 1 out9.9800 XPM110 B
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.27 KB
50 in → 1 out199.9200 XPM7.26 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 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.

8.276 × 10⁹⁵(96-digit number)
82760324028431424265…61440524662887156799
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
8.276 × 10⁹⁵(96-digit number)
82760324028431424265…61440524662887156799
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
8.276 × 10⁹⁵(96-digit number)
82760324028431424265…61440524662887156801
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.655 × 10⁹⁶(97-digit number)
16552064805686284853…22881049325774313599
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.655 × 10⁹⁶(97-digit number)
16552064805686284853…22881049325774313601
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.310 × 10⁹⁶(97-digit number)
33104129611372569706…45762098651548627199
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
3.310 × 10⁹⁶(97-digit number)
33104129611372569706…45762098651548627201
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.620 × 10⁹⁶(97-digit number)
66208259222745139412…91524197303097254399
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
6.620 × 10⁹⁶(97-digit number)
66208259222745139412…91524197303097254401
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.324 × 10⁹⁷(98-digit number)
13241651844549027882…83048394606194508799
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.324 × 10⁹⁷(98-digit number)
13241651844549027882…83048394606194508801
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,980,627 XPM·at block #6,842,029 · 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