Home/Chain Registry/Block #922,252

Block #922,252

TWNLength 12★★★★☆

Bi-Twin Chain · Discovered 2/4/2015, 7:53:57 AM · Difficulty 10.9161 · 5,904,967 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
c4b92671fb6658830a5df1ee97435ba7d500d75dbacac72072258223fa61c632

Height

#922,252

Difficulty

10.916072

Transactions

5

Size

115.99 KB

Version

2

Bits

0aea83af

Nonce

13,990,171

Timestamp

2/4/2015, 7:53:57 AM

Confirmations

5,904,967

Merkle Root

be9bd794fe01b722a68e7b6ab47a59867777d927ebd180e02bed7b8130877f72
Transactions (5)
1 in → 1 out9.5800 XPM116 B
200 in → 1 out1091.6922 XPM28.94 KB
200 in → 1 out1064.2499 XPM28.93 KB
200 in → 1 out1009.1924 XPM28.96 KB
200 in → 1 out1100.9892 XPM28.96 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.

3.207 × 10⁹⁶(97-digit number)
32076804812832453643…12452464698322836480
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
3.207 × 10⁹⁶(97-digit number)
32076804812832453643…12452464698322836479
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
3.207 × 10⁹⁶(97-digit number)
32076804812832453643…12452464698322836481
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
6.415 × 10⁹⁶(97-digit number)
64153609625664907286…24904929396645672959
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
6.415 × 10⁹⁶(97-digit number)
64153609625664907286…24904929396645672961
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.283 × 10⁹⁷(98-digit number)
12830721925132981457…49809858793291345919
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
1.283 × 10⁹⁷(98-digit number)
12830721925132981457…49809858793291345921
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.566 × 10⁹⁷(98-digit number)
25661443850265962914…99619717586582691839
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
2.566 × 10⁹⁷(98-digit number)
25661443850265962914…99619717586582691841
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
5.132 × 10⁹⁷(98-digit number)
51322887700531925828…99239435173165383679
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
5.132 × 10⁹⁷(98-digit number)
51322887700531925828…99239435173165383681
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.026 × 10⁹⁸(99-digit number)
10264577540106385165…98478870346330767359
Verify on FactorDB ↗Wolfram Alpha ↗
2^5 × origin + 1
1.026 × 10⁹⁸(99-digit number)
10264577540106385165…98478870346330767361
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^5 × origin + 1 − 2^5 × origin − 1 = 2 (twin primes ✓)

What this block proved

The miner who found this block proved the existence of 12 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.

View full Prime Chain Discovery page →
★★★★☆
Rarity
ExceptionalChain length 12
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
Verify on a Primecoin Node

Anyone running a Primecoin node can independently verify this block using the following RPC commands. Run these from the primecoin-cli command line or via the debug console in the Primecoin wallet.

1. Get block hash by height
getblockhash 922252

Returns the block hash for a given block height. Use this to confirm the hash shown above matches the chain.

2. Get full block data
getblock c4b92671fb6658830a5df1ee97435ba7d500d75dbacac72072258223fa61c632

Returns the full block header including difficulty, prime chain origin, prime chain type, transaction IDs, and all other fields shown on this page.

How to run these commands: To verify this data independently, open a terminal on your own Primecoin node and run primecoin-cli <command>. Alternatively, open the Primecoin-Qt wallet, go to Help → Debug Window → Console, and type the command directly. The node must be fully synced to this block height for the commands to return results.

Cross-reference on Chainz Explorer

Chainz is an independent Primecoin block explorer. Compare this block's data to verify accuracy.

View Block #922,252 on Chainz ↗
Circulating Supply:57,861,849 XPM·at block #6,827,218 · 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