Block #1,536,631

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/11/2016, 4:06:40 PM · Difficulty 10.6283 · 5,290,416 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c21b4bb01f896e20af2c5f1c4f7cb3724a7e858826dc1e04ad1cec1ca33bcec8

Height

#1,536,631

Difficulty

10.628268

Transactions

2

Size

1.31 KB

Version

2

Bits

0aa0d634

Nonce

315,983,064

Timestamp

4/11/2016, 4:06:40 PM

Confirmations

5,290,416

Merkle Root

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

1.454 × 10⁹⁶(97-digit number)
14548336189874359971…72668958152979970559
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
1.454 × 10⁹⁶(97-digit number)
14548336189874359971…72668958152979970559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.909 × 10⁹⁶(97-digit number)
29096672379748719943…45337916305959941119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.819 × 10⁹⁶(97-digit number)
58193344759497439886…90675832611919882239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.163 × 10⁹⁷(98-digit number)
11638668951899487977…81351665223839764479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.327 × 10⁹⁷(98-digit number)
23277337903798975954…62703330447679528959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.655 × 10⁹⁷(98-digit number)
46554675807597951909…25406660895359057919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.310 × 10⁹⁷(98-digit number)
93109351615195903818…50813321790718115839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.862 × 10⁹⁸(99-digit number)
18621870323039180763…01626643581436231679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.724 × 10⁹⁸(99-digit number)
37243740646078361527…03253287162872463359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.448 × 10⁹⁸(99-digit number)
74487481292156723054…06506574325744926719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.489 × 10⁹⁹(100-digit number)
14897496258431344610…13013148651489853439
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,860,557 XPM·at block #6,827,046 · 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