Block #3,505,243

TWNLength 10★★☆☆☆

Bi-Twin Chain · Discovered 1/8/2020, 11:48:51 AM · Difficulty 10.9306 · 3,331,449 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
2cffcf940853bb9bd61b05a99a4c8e157a3828e6217461166f02bb6ab6523752

Height

#3,505,243

Difficulty

10.930577

Transactions

6

Size

29.60 KB

Version

2

Bits

0aee3a44

Nonce

1,634,811,996

Timestamp

1/8/2020, 11:48:51 AM

Confirmations

3,331,449

Merkle Root

0b53c2075ef18c6fb2f927ad8c77c8385b89bb6b7f8bed78e541d20fd1f1b98c
Transactions (6)
1 in → 1 out8.6900 XPM109 B
50 in → 1 out199.9200 XPM7.26 KB
50 in → 1 out199.9200 XPM7.28 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out1963.3377 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.166 × 10⁹⁸(99-digit number)
11664408370131525410…26883661318810173439
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.166 × 10⁹⁸(99-digit number)
11664408370131525410…26883661318810173439
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.166 × 10⁹⁸(99-digit number)
11664408370131525410…26883661318810173441
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.332 × 10⁹⁸(99-digit number)
23328816740263050821…53767322637620346879
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
2.332 × 10⁹⁸(99-digit number)
23328816740263050821…53767322637620346881
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.665 × 10⁹⁸(99-digit number)
46657633480526101642…07534645275240693759
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
4.665 × 10⁹⁸(99-digit number)
46657633480526101642…07534645275240693761
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.331 × 10⁹⁸(99-digit number)
93315266961052203285…15069290550481387519
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
9.331 × 10⁹⁸(99-digit number)
93315266961052203285…15069290550481387521
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.866 × 10⁹⁹(100-digit number)
18663053392210440657…30138581100962775039
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.866 × 10⁹⁹(100-digit number)
18663053392210440657…30138581100962775041
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,937,816 XPM·at block #6,836,691 · 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