Block #2,632,867

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 2:40:50 AM · Difficulty 11.1775 · 4,200,903 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6194017149bf3d5e55ff1364cd9e89290ac901c786c9dbe3c65705d2e5b84dad

Height

#2,632,867

Difficulty

11.177539

Transactions

8

Size

2.49 KB

Version

2

Bits

0b2d7336

Nonce

966,670,005

Timestamp

4/28/2018, 2:40:50 AM

Confirmations

4,200,903

Merkle Root

684b7c2e07cee1ddb3d0c0088f53f7126f3c2eeba0fcee1d8ab853eaf5edb848
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.537 × 10⁹⁵(96-digit number)
35372258845347156796…85686949028020324479
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.537 × 10⁹⁵(96-digit number)
35372258845347156796…85686949028020324479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.074 × 10⁹⁵(96-digit number)
70744517690694313592…71373898056040648959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.414 × 10⁹⁶(97-digit number)
14148903538138862718…42747796112081297919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.829 × 10⁹⁶(97-digit number)
28297807076277725436…85495592224162595839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.659 × 10⁹⁶(97-digit number)
56595614152555450873…70991184448325191679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.131 × 10⁹⁷(98-digit number)
11319122830511090174…41982368896650383359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.263 × 10⁹⁷(98-digit number)
22638245661022180349…83964737793300766719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.527 × 10⁹⁷(98-digit number)
45276491322044360699…67929475586601533439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.055 × 10⁹⁷(98-digit number)
90552982644088721398…35858951173203066879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.811 × 10⁹⁸(99-digit number)
18110596528817744279…71717902346406133759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.622 × 10⁹⁸(99-digit number)
36221193057635488559…43435804692812267519
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,914,378 XPM·at block #6,833,769 · 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