1. #6,831,7241CC11 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #2,643,314

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 5/2/2018, 1:43:01 AM · Difficulty 11.6794 · 4,188,411 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
3dd35cb3418869f5a86b3de8a30585b5b907131a5909172c9e0dd409db2d5b8d

Height

#2,643,314

Difficulty

11.679382

Transactions

21

Size

5.70 KB

Version

2

Bits

0badebf7

Nonce

528,469,931

Timestamp

5/2/2018, 1:43:01 AM

Confirmations

4,188,411

Merkle Root

2d5311998003bf68729caaeee13f2b12e7db1d6af6384b87980ddf5ec78ae82c
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.

2.653 × 10⁹³(94-digit number)
26533437009771769404…18466482335881689659
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
2.653 × 10⁹³(94-digit number)
26533437009771769404…18466482335881689659
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
2.653 × 10⁹³(94-digit number)
26533437009771769404…18466482335881689661
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
5.306 × 10⁹³(94-digit number)
53066874019543538808…36932964671763379319
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
5.306 × 10⁹³(94-digit number)
53066874019543538808…36932964671763379321
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.061 × 10⁹⁴(95-digit number)
10613374803908707761…73865929343526758639
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
1.061 × 10⁹⁴(95-digit number)
10613374803908707761…73865929343526758641
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
2.122 × 10⁹⁴(95-digit number)
21226749607817415523…47731858687053517279
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
2.122 × 10⁹⁴(95-digit number)
21226749607817415523…47731858687053517281
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
4.245 × 10⁹⁴(95-digit number)
42453499215634831047…95463717374107034559
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
4.245 × 10⁹⁴(95-digit number)
42453499215634831047…95463717374107034561
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
8.490 × 10⁹⁴(95-digit number)
84906998431269662094…90927434748214069119
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,897,903 XPM·at block #6,831,724 · 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