Block #3,505,260

TWNLength 10★★☆☆☆

Bi-Twin Chain · Discovered 1/8/2020, 12:03:01 PM · Difficulty 10.9306 · 3,335,573 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
b57b1e9f37e2e7be40e99cf3de7d0d44a867b69ba236e58e330d2e093f649c73

Height

#3,505,260

Difficulty

10.930623

Transactions

11

Size

72.90 KB

Version

2

Bits

0aee3d49

Nonce

683,731,161

Timestamp

1/8/2020, 12:03:01 PM

Confirmations

3,335,573

Merkle Root

86dc43a05ef6da855d83d89fd50c29f9d2b4258a13bc8713dab80c70a1896750
Transactions (11)
1 in → 1 out9.1600 XPM110 B
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.27 KB
50 in → 1 out3922.4000 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.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.

1.431 × 10⁹⁴(95-digit number)
14312614371936337870…26435521320699842149
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.431 × 10⁹⁴(95-digit number)
14312614371936337870…26435521320699842149
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.431 × 10⁹⁴(95-digit number)
14312614371936337870…26435521320699842151
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
2.862 × 10⁹⁴(95-digit number)
28625228743872675740…52871042641399684299
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
2.862 × 10⁹⁴(95-digit number)
28625228743872675740…52871042641399684301
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
5.725 × 10⁹⁴(95-digit number)
57250457487745351481…05742085282799368599
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
5.725 × 10⁹⁴(95-digit number)
57250457487745351481…05742085282799368601
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.145 × 10⁹⁵(96-digit number)
11450091497549070296…11484170565598737199
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.145 × 10⁹⁵(96-digit number)
11450091497549070296…11484170565598737201
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.290 × 10⁹⁵(96-digit number)
22900182995098140592…22968341131197474399
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
2.290 × 10⁹⁵(96-digit number)
22900182995098140592…22968341131197474401
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,971,010 XPM·at block #6,840,832 · 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