Block #2,654,905

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/9/2018, 5:56:25 PM · Difficulty 11.7124 · 4,176,086 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
064a60b602517ac34ee7bc1c2caf12eb2784d8a43ee6a8414169c8e7825ef459

Height

#2,654,905

Difficulty

11.712423

Transactions

8

Size

2.29 KB

Version

2

Bits

0bb66154

Nonce

1,100,751,837

Timestamp

5/9/2018, 5:56:25 PM

Confirmations

4,176,086

Merkle Root

40bee0aa4dea36eabe72be652a781f1118906025d2a7e32e34410552a954da3a
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.579 × 10⁹³(94-digit number)
85792207573936483402…21702594499101119599
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.579 × 10⁹³(94-digit number)
85792207573936483402…21702594499101119599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.715 × 10⁹⁴(95-digit number)
17158441514787296680…43405188998202239199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.431 × 10⁹⁴(95-digit number)
34316883029574593360…86810377996404478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.863 × 10⁹⁴(95-digit number)
68633766059149186721…73620755992808956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.372 × 10⁹⁵(96-digit number)
13726753211829837344…47241511985617913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.745 × 10⁹⁵(96-digit number)
27453506423659674688…94483023971235827199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.490 × 10⁹⁵(96-digit number)
54907012847319349377…88966047942471654399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.098 × 10⁹⁶(97-digit number)
10981402569463869875…77932095884943308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.196 × 10⁹⁶(97-digit number)
21962805138927739750…55864191769886617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.392 × 10⁹⁶(97-digit number)
43925610277855479501…11728383539773235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.785 × 10⁹⁶(97-digit number)
87851220555710959003…23456767079546470399
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,892,068 XPM·at block #6,830,990 · 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