Block #3,506,380

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/9/2020, 6:52:52 AM · Difficulty 10.9305 · 3,318,643 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
4d62db10340774d04f2e480348d2b9d6d4ad7ed7b95e7ad99858bd56942f359f

Height

#3,506,380

Difficulty

10.930545

Transactions

11

Size

72.88 KB

Version

2

Bits

0aee3838

Nonce

174,795,322

Timestamp

1/9/2020, 6:52:52 AM

Confirmations

3,318,643

Merkle Root

f8a4e4ecdb0419077e7c8e76b1c0e8edc64508ebf9870ebafd537191a40d7702
Transactions (11)
1 in → 1 out9.1600 XPM110 B
50 in → 1 out50.2939 XPM7.27 KB
50 in → 1 out50.3095 XPM7.27 KB
50 in → 1 out50.2772 XPM7.27 KB
50 in → 1 out50.2902 XPM7.26 KB
50 in → 1 out50.2862 XPM7.26 KB
50 in → 1 out50.2816 XPM7.27 KB
50 in → 1 out50.2978 XPM7.27 KB
50 in → 1 out5971.3826 XPM7.27 KB
50 in → 1 out50.3059 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.

2.147 × 10⁹³(94-digit number)
21472461960371131548…95438053300168536339
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.147 × 10⁹³(94-digit number)
21472461960371131548…95438053300168536339
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
2.147 × 10⁹³(94-digit number)
21472461960371131548…95438053300168536341
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
4.294 × 10⁹³(94-digit number)
42944923920742263097…90876106600337072679
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
4.294 × 10⁹³(94-digit number)
42944923920742263097…90876106600337072681
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
8.588 × 10⁹³(94-digit number)
85889847841484526194…81752213200674145359
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
8.588 × 10⁹³(94-digit number)
85889847841484526194…81752213200674145361
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.717 × 10⁹⁴(95-digit number)
17177969568296905238…63504426401348290719
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.717 × 10⁹⁴(95-digit number)
17177969568296905238…63504426401348290721
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
3.435 × 10⁹⁴(95-digit number)
34355939136593810477…27008852802696581439
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
3.435 × 10⁹⁴(95-digit number)
34355939136593810477…27008852802696581441
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^4 × origin + 1 − 2^4 × origin − 1 = 2 (twin primes ✓)
Level 5 — Twin Prime Pair (2^5 × origin ± 1)
2^5 × origin − 1
6.871 × 10⁹⁴(95-digit number)
68711878273187620955…54017705605393162879
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,844,267 XPM·at block #6,825,022 · 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