Block #3,503,115

TWNLength 10★★☆☆☆

Bi-Twin Chain · Discovered 1/7/2020, 12:07:18 AM · Difficulty 10.9307 · 3,310,853 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
d506025574d65c72b1d46a31c9a24415f10d685dfe390d82a4281f9cf3ab5bf1

Height

#3,503,115

Difficulty

10.930703

Transactions

10

Size

65.61 KB

Version

2

Bits

0aee428a

Nonce

990,931,941

Timestamp

1/7/2020, 12:07:18 AM

Confirmations

3,310,853

Merkle Root

e4bce8815063b4f81222a71f8c4a0bd0455a3774c4abdc99bdebde37dce7342a
Transactions (10)
1 in → 1 out9.0800 XPM109 B
50 in → 1 out799.9200 XPM7.27 KB
50 in → 1 out799.9200 XPM7.26 KB
50 in → 1 out799.9200 XPM7.27 KB
50 in → 1 out799.9200 XPM7.27 KB
50 in → 1 out799.9200 XPM7.26 KB
50 in → 1 out799.9200 XPM7.27 KB
50 in → 1 out799.9200 XPM7.27 KB
50 in → 1 out799.9200 XPM7.27 KB
50 in → 1 out799.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.

2.508 × 10⁹⁴(95-digit number)
25081054528395827363…47560044848022842879
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
2.508 × 10⁹⁴(95-digit number)
25081054528395827363…47560044848022842879
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
2.508 × 10⁹⁴(95-digit number)
25081054528395827363…47560044848022842881
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
5.016 × 10⁹⁴(95-digit number)
50162109056791654726…95120089696045685759
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
5.016 × 10⁹⁴(95-digit number)
50162109056791654726…95120089696045685761
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.003 × 10⁹⁵(96-digit number)
10032421811358330945…90240179392091371519
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
1.003 × 10⁹⁵(96-digit number)
10032421811358330945…90240179392091371521
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.006 × 10⁹⁵(96-digit number)
20064843622716661890…80480358784182743039
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
2.006 × 10⁹⁵(96-digit number)
20064843622716661890…80480358784182743041
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.012 × 10⁹⁵(96-digit number)
40129687245433323781…60960717568365486079
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
4.012 × 10⁹⁵(96-digit number)
40129687245433323781…60960717568365486081
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,755,820 XPM·at block #6,813,967 · 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