1. #6,810,1741CC10 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #313,809

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 12/15/2013, 3:56:11 PM · Difficulty 10.0272 · 6,496,366 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
4f782bbee2ddc9373e38ba8c196ebc1927b7294525398035c57648841f42e1df

Height

#313,809

Difficulty

10.027166

Transactions

15

Size

5.89 KB

Version

2

Bits

0a06f459

Nonce

106,236

Timestamp

12/15/2013, 3:56:11 PM

Confirmations

6,496,366

Merkle Root

83acf8927d002e7dd87358c95c9a91a1a5b726a3081b1a2b076c96a699375ef8
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.082 × 10⁹⁸(99-digit number)
10827830555968221948…94804833457607380159
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.082 × 10⁹⁸(99-digit number)
10827830555968221948…94804833457607380159
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.082 × 10⁹⁸(99-digit number)
10827830555968221948…94804833457607380161
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.165 × 10⁹⁸(99-digit number)
21655661111936443897…89609666915214760319
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
2.165 × 10⁹⁸(99-digit number)
21655661111936443897…89609666915214760321
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.331 × 10⁹⁸(99-digit number)
43311322223872887795…79219333830429520639
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
4.331 × 10⁹⁸(99-digit number)
43311322223872887795…79219333830429520641
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
8.662 × 10⁹⁸(99-digit number)
86622644447745775591…58438667660859041279
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
8.662 × 10⁹⁸(99-digit number)
86622644447745775591…58438667660859041281
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.732 × 10⁹⁹(100-digit number)
17324528889549155118…16877335321718082559
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.732 × 10⁹⁹(100-digit number)
17324528889549155118…16877335321718082561
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
3.464 × 10⁹⁹(100-digit number)
34649057779098310236…33754670643436165119
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,725,468 XPM·at block #6,810,174 · 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.

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