Block #2,561,670

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 3/12/2018, 6:55:30 AM · Difficulty 10.9925 · 4,280,303 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
a620bcc49ca1be2765854a7ceb49f2a6ff34a58214a4d6de78bce67dfeaa23a5

Height

#2,561,670

Difficulty

10.992493

Transactions

54

Size

15.62 KB

Version

2

Bits

0afe140d

Nonce

860,064,173

Timestamp

3/12/2018, 6:55:30 AM

Confirmations

4,280,303

Merkle Root

c8791f313aa06c12a937f8ff456adba0ee2659a59b166f834cca6b18da0338e7
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.289 × 10⁹⁵(96-digit number)
12891207013653029776…03652985907651870719
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.289 × 10⁹⁵(96-digit number)
12891207013653029776…03652985907651870719
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.289 × 10⁹⁵(96-digit number)
12891207013653029776…03652985907651870721
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.578 × 10⁹⁵(96-digit number)
25782414027306059552…07305971815303741439
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
2.578 × 10⁹⁵(96-digit number)
25782414027306059552…07305971815303741441
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
5.156 × 10⁹⁵(96-digit number)
51564828054612119104…14611943630607482879
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
5.156 × 10⁹⁵(96-digit number)
51564828054612119104…14611943630607482881
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.031 × 10⁹⁶(97-digit number)
10312965610922423820…29223887261214965759
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.031 × 10⁹⁶(97-digit number)
10312965610922423820…29223887261214965761
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
2.062 × 10⁹⁶(97-digit number)
20625931221844847641…58447774522429931519
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
2.062 × 10⁹⁶(97-digit number)
20625931221844847641…58447774522429931521
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
4.125 × 10⁹⁶(97-digit number)
41251862443689695283…16895549044859863039
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,980,168 XPM·at block #6,841,972 · 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