Block #3,505,263

TWNLength 10★★☆☆☆

Bi-Twin Chain · Discovered 1/8/2020, 12:04:54 PM · Difficulty 10.9306 · 3,334,500 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
1bbee023630769d5d3c12e0f54d80a53a4fe9152141158816f151e308f380003

Height

#3,505,263

Difficulty

10.930637

Transactions

15

Size

74.50 KB

Version

2

Bits

0aee3e35

Nonce

110,298,589

Timestamp

1/8/2020, 12:04:54 PM

Confirmations

3,334,500

Merkle Root

d89c10605e73b98cacebe11878f128bf2b4587e46e417f78e05f47a026cf4ee1
Transactions (15)
1 in → 1 out9.2000 XPM109 B
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.26 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.133 × 10⁹⁴(95-digit number)
11331369252649468338…86390816739846374399
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.133 × 10⁹⁴(95-digit number)
11331369252649468338…86390816739846374399
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.133 × 10⁹⁴(95-digit number)
11331369252649468338…86390816739846374401
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.266 × 10⁹⁴(95-digit number)
22662738505298936677…72781633479692748799
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
2.266 × 10⁹⁴(95-digit number)
22662738505298936677…72781633479692748801
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
4.532 × 10⁹⁴(95-digit number)
45325477010597873355…45563266959385497599
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
4.532 × 10⁹⁴(95-digit number)
45325477010597873355…45563266959385497601
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
9.065 × 10⁹⁴(95-digit number)
90650954021195746711…91126533918770995199
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
9.065 × 10⁹⁴(95-digit number)
90650954021195746711…91126533918770995201
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.813 × 10⁹⁵(96-digit number)
18130190804239149342…82253067837541990399
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.813 × 10⁹⁵(96-digit number)
18130190804239149342…82253067837541990401
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,962,393 XPM·at block #6,839,762 · 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