1. #6,840,740TWN12 primes

    Bi-Twin · ⛏️ coinsforall.io

  2. #6,840,739TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #1,435,298

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/29/2016, 9:05:37 PM · Difficulty 10.8113 · 5,405,443 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
6227711906934d0620dd4ac9dbacc5031ad223d41b18a3bb798779e7e1420808

Height

#1,435,298

Difficulty

10.811323

Transactions

2

Size

867 B

Version

2

Bits

0acfb2e3

Nonce

524,371,329

Timestamp

1/29/2016, 9:05:37 PM

Confirmations

5,405,443

Merkle Root

f7813ce66eef7ef67a0603f652f6652c5cc454ac1cf2e207e2cb10a8cc58a697
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.

6.507 × 10⁹¹(92-digit number)
65073689167456712624…23437556045601283839
Discovered Prime Numbers
p_k = 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.

1
origin − 1
6.507 × 10⁹¹(92-digit number)
65073689167456712624…23437556045601283839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.301 × 10⁹²(93-digit number)
13014737833491342524…46875112091202567679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.602 × 10⁹²(93-digit number)
26029475666982685049…93750224182405135359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.205 × 10⁹²(93-digit number)
52058951333965370099…87500448364810270719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.041 × 10⁹³(94-digit number)
10411790266793074019…75000896729620541439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.082 × 10⁹³(94-digit number)
20823580533586148039…50001793459241082879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.164 × 10⁹³(94-digit number)
41647161067172296079…00003586918482165759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.329 × 10⁹³(94-digit number)
83294322134344592158…00007173836964331519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.665 × 10⁹⁴(95-digit number)
16658864426868918431…00014347673928663039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.331 × 10⁹⁴(95-digit number)
33317728853737836863…00028695347857326079
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the First Kind. 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,970,271 XPM·at block #6,840,740 · 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