Block #1,832,462

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/2/2016, 7:30:01 AM · Difficulty 10.7154 · 4,999,693 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1136318da4748d595e005a48b1f4570fd6cd5e74a1137f19d3aeb70a67a60efd

Height

#1,832,462

Difficulty

10.715416

Transactions

2

Size

1.28 KB

Version

2

Bits

0ab72586

Nonce

457,660,227

Timestamp

11/2/2016, 7:30:01 AM

Confirmations

4,999,693

Merkle Root

aa2f80b4a6d5863526b9bc54b87d64cf39cf622bcd7eb8779d76bd39f780f288
Transactions (2)
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.465 × 10⁹⁶(97-digit number)
34650417352846152020…38452991240158561279
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
3.465 × 10⁹⁶(97-digit number)
34650417352846152020…38452991240158561279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.930 × 10⁹⁶(97-digit number)
69300834705692304040…76905982480317122559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.386 × 10⁹⁷(98-digit number)
13860166941138460808…53811964960634245119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.772 × 10⁹⁷(98-digit number)
27720333882276921616…07623929921268490239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.544 × 10⁹⁷(98-digit number)
55440667764553843232…15247859842536980479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.108 × 10⁹⁸(99-digit number)
11088133552910768646…30495719685073960959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.217 × 10⁹⁸(99-digit number)
22176267105821537292…60991439370147921919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.435 × 10⁹⁸(99-digit number)
44352534211643074585…21982878740295843839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.870 × 10⁹⁸(99-digit number)
88705068423286149171…43965757480591687679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.774 × 10⁹⁹(100-digit number)
17741013684657229834…87931514961183375359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.548 × 10⁹⁹(100-digit number)
35482027369314459668…75863029922366750719
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,901,379 XPM·at block #6,832,154 · 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