Block #3,503,305

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/7/2020, 3:22:52 AM · Difficulty 10.9306 · 3,337,032 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
db832f19a376651996db944a09839fed302a5ae2f0229cc8ee4eb83b497f9dc2

Height

#3,503,305

Difficulty

10.930634

Transactions

11

Size

72.88 KB

Version

2

Bits

0aee3e03

Nonce

881,236,413

Timestamp

1/7/2020, 3:22:52 AM

Confirmations

3,337,032

Merkle Root

ae11504988555327dfd170dc788109b836f9d4150641898f9ddc4dcd984daa4f
Transactions (11)
1 in → 1 out9.1600 XPM110 B
50 in → 1 out599.9200 XPM7.26 KB
50 in → 1 out599.9200 XPM7.27 KB
50 in → 1 out599.9200 XPM7.26 KB
50 in → 1 out599.9200 XPM7.26 KB
50 in → 1 out599.9200 XPM7.26 KB
50 in → 1 out599.9200 XPM7.26 KB
50 in → 1 out599.9200 XPM7.27 KB
50 in → 1 out599.9200 XPM7.27 KB
50 in → 1 out599.9200 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.

4.333 × 10⁹⁶(97-digit number)
43333279394410662530…35435809955319838719
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
4.333 × 10⁹⁶(97-digit number)
43333279394410662530…35435809955319838719
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
4.333 × 10⁹⁶(97-digit number)
43333279394410662530…35435809955319838721
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
8.666 × 10⁹⁶(97-digit number)
86666558788821325061…70871619910639677439
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
8.666 × 10⁹⁶(97-digit number)
86666558788821325061…70871619910639677441
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.733 × 10⁹⁷(98-digit number)
17333311757764265012…41743239821279354879
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
1.733 × 10⁹⁷(98-digit number)
17333311757764265012…41743239821279354881
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
3.466 × 10⁹⁷(98-digit number)
34666623515528530024…83486479642558709759
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
3.466 × 10⁹⁷(98-digit number)
34666623515528530024…83486479642558709761
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
6.933 × 10⁹⁷(98-digit number)
69333247031057060049…66972959285117419519
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
6.933 × 10⁹⁷(98-digit number)
69333247031057060049…66972959285117419521
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
1.386 × 10⁹⁸(99-digit number)
13866649406211412009…33945918570234839039
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,967,017 XPM·at block #6,840,336 · 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