Block #3,504,303

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/7/2020, 7:37:08 PM · Difficulty 10.9310 · 3,333,377 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
b0cf038fac4ef6d00e19822a524ea8d922a8f7d47b1b1a510c29ef29e5ee23d7

Height

#3,504,303

Difficulty

10.930986

Transactions

11

Size

72.89 KB

Version

2

Bits

0aee5516

Nonce

1,291,900,932

Timestamp

1/7/2020, 7:37:08 PM

Confirmations

3,333,377

Merkle Root

bb539e77375cdec32dc92cb0116d03c6b35ac7aa65b436a28608558d2561e04e
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 out199.9200 XPM7.26 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out4902.2444 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.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.

1.898 × 10⁹⁴(95-digit number)
18982493509292543344…29472342325720057519
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.898 × 10⁹⁴(95-digit number)
18982493509292543344…29472342325720057519
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.898 × 10⁹⁴(95-digit number)
18982493509292543344…29472342325720057521
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
3.796 × 10⁹⁴(95-digit number)
37964987018585086689…58944684651440115039
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
3.796 × 10⁹⁴(95-digit number)
37964987018585086689…58944684651440115041
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
7.592 × 10⁹⁴(95-digit number)
75929974037170173378…17889369302880230079
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
7.592 × 10⁹⁴(95-digit number)
75929974037170173378…17889369302880230081
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.518 × 10⁹⁵(96-digit number)
15185994807434034675…35778738605760460159
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.518 × 10⁹⁵(96-digit number)
15185994807434034675…35778738605760460161
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.037 × 10⁹⁵(96-digit number)
30371989614868069351…71557477211520920319
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
3.037 × 10⁹⁵(96-digit number)
30371989614868069351…71557477211520920321
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.074 × 10⁹⁵(96-digit number)
60743979229736138702…43114954423041840639
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,945,765 XPM·at block #6,837,679 · 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