Block #3,504,008

TWNLength 10★★☆☆☆

Bi-Twin Chain · Discovered 1/7/2020, 2:54:40 PM · Difficulty 10.9308 · 3,329,896 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
2ca485da823814d79cb6af66afdf009eb7ab0108fd561c1dca2c3d830502d250

Height

#3,504,008

Difficulty

10.930824

Transactions

9

Size

58.35 KB

Version

2

Bits

0aee4a79

Nonce

280,473,110

Timestamp

1/7/2020, 2:54:40 PM

Confirmations

3,329,896

Merkle Root

6533c0c80619b5f44d8920c664b8087a9f16fe4714e941baf2a5edbbd10e9812
Transactions (9)
1 in → 1 out9.0000 XPM110 B
50 in → 1 out206.0493 XPM7.26 KB
50 in → 1 out205.9548 XPM7.27 KB
50 in → 1 out205.9081 XPM7.28 KB
50 in → 1 out206.0199 XPM7.26 KB
50 in → 1 out206.0762 XPM7.27 KB
50 in → 1 out205.8828 XPM7.27 KB
50 in → 1 out205.9313 XPM7.27 KB
50 in → 1 out205.9880 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.057 × 10⁹⁵(96-digit number)
80572960306015677126…06141933992690032639
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.057 × 10⁹⁵(96-digit number)
80572960306015677126…06141933992690032639
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
8.057 × 10⁹⁵(96-digit number)
80572960306015677126…06141933992690032641
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.611 × 10⁹⁶(97-digit number)
16114592061203135425…12283867985380065279
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.611 × 10⁹⁶(97-digit number)
16114592061203135425…12283867985380065281
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.222 × 10⁹⁶(97-digit number)
32229184122406270850…24567735970760130559
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
3.222 × 10⁹⁶(97-digit number)
32229184122406270850…24567735970760130561
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.445 × 10⁹⁶(97-digit number)
64458368244812541701…49135471941520261119
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
6.445 × 10⁹⁶(97-digit number)
64458368244812541701…49135471941520261121
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.289 × 10⁹⁷(98-digit number)
12891673648962508340…98270943883040522239
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.289 × 10⁹⁷(98-digit number)
12891673648962508340…98270943883040522241
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,915,458 XPM·at block #6,833,903 · 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