Block #2,155,320

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 6/10/2017, 9:22:07 PM · Difficulty 10.9057 · 4,661,756 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
a743654d4f3f179105f1d103871e195c69875fada5cd52268b020d1f001c576a

Height

#2,155,320

Difficulty

10.905746

Transactions

35

Size

9.92 KB

Version

2

Bits

0ae7def8

Nonce

452,913,275

Timestamp

6/10/2017, 9:22:07 PM

Confirmations

4,661,756

Merkle Root

21c75dedae4c72b618de192a168d1f8ca391e2f3dd9414827e87bef9114eb603
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.807 × 10⁹⁸(99-digit number)
48077279158822684034…65698080887413145599
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.807 × 10⁹⁸(99-digit number)
48077279158822684034…65698080887413145599
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
4.807 × 10⁹⁸(99-digit number)
48077279158822684034…65698080887413145601
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
9.615 × 10⁹⁸(99-digit number)
96154558317645368068…31396161774826291199
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
9.615 × 10⁹⁸(99-digit number)
96154558317645368068…31396161774826291201
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.923 × 10⁹⁹(100-digit number)
19230911663529073613…62792323549652582399
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
1.923 × 10⁹⁹(100-digit number)
19230911663529073613…62792323549652582401
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.846 × 10⁹⁹(100-digit number)
38461823327058147227…25584647099305164799
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
3.846 × 10⁹⁹(100-digit number)
38461823327058147227…25584647099305164801
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
7.692 × 10⁹⁹(100-digit number)
76923646654116294455…51169294198610329599
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
7.692 × 10⁹⁹(100-digit number)
76923646654116294455…51169294198610329601
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.538 × 10¹⁰⁰(101-digit number)
15384729330823258891…02338588397220659199
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,780,645 XPM·at block #6,817,075 · 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