Block #1,743,581

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/1/2016, 12:07:24 PM · Difficulty 10.7184 · 5,098,622 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d18549d3e40ffc3b565286ff75c2eed812b50ce7fc2b33940151764bd387c452

Height

#1,743,581

Difficulty

10.718371

Transactions

37

Size

12.37 KB

Version

2

Bits

0ab7e726

Nonce

523,299,404

Timestamp

9/1/2016, 12:07:24 PM

Confirmations

5,098,622

Merkle Root

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

8.420 × 10⁹⁴(95-digit number)
84202915077123600119…14682106010732075999
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
8.420 × 10⁹⁴(95-digit number)
84202915077123600119…14682106010732075999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.684 × 10⁹⁵(96-digit number)
16840583015424720023…29364212021464151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.368 × 10⁹⁵(96-digit number)
33681166030849440047…58728424042928303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.736 × 10⁹⁵(96-digit number)
67362332061698880095…17456848085856607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.347 × 10⁹⁶(97-digit number)
13472466412339776019…34913696171713215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.694 × 10⁹⁶(97-digit number)
26944932824679552038…69827392343426431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.388 × 10⁹⁶(97-digit number)
53889865649359104076…39654784686852863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.077 × 10⁹⁷(98-digit number)
10777973129871820815…79309569373705727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.155 × 10⁹⁷(98-digit number)
21555946259743641630…58619138747411455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.311 × 10⁹⁷(98-digit number)
43111892519487283261…17238277494822911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.622 × 10⁹⁷(98-digit number)
86223785038974566522…34476554989645823999
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,982,019 XPM·at block #6,842,202 · 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