Block #2,134,074

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/26/2017, 11:59:20 PM · Difficulty 10.9088 · 4,704,935 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b1d92125dae4db3825dc3eaf6d1a291a128445cff205497296dba3616a1707cc

Height

#2,134,074

Difficulty

10.908764

Transactions

3

Size

652 B

Version

2

Bits

0ae8a4bb

Nonce

310,347,783

Timestamp

5/26/2017, 11:59:20 PM

Confirmations

4,704,935

Merkle Root

bf6a75f67a5a92e642977a212f37f9860446ff9cbe391434ddaeac63a089c960
Transactions (3)
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.

5.005 × 10⁹⁴(95-digit number)
50054523003790738764…83771065240431743999
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
5.005 × 10⁹⁴(95-digit number)
50054523003790738764…83771065240431743999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.001 × 10⁹⁵(96-digit number)
10010904600758147752…67542130480863487999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.002 × 10⁹⁵(96-digit number)
20021809201516295505…35084260961726975999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.004 × 10⁹⁵(96-digit number)
40043618403032591011…70168521923453951999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.008 × 10⁹⁵(96-digit number)
80087236806065182022…40337043846907903999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.601 × 10⁹⁶(97-digit number)
16017447361213036404…80674087693815807999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.203 × 10⁹⁶(97-digit number)
32034894722426072809…61348175387631615999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.406 × 10⁹⁶(97-digit number)
64069789444852145618…22696350775263231999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.281 × 10⁹⁷(98-digit number)
12813957888970429123…45392701550526463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.562 × 10⁹⁷(98-digit number)
25627915777940858247…90785403101052927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.125 × 10⁹⁷(98-digit number)
51255831555881716494…81570806202105855999
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 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
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 1CC formula:

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