Block #787,419

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/29/2014, 1:16:34 AM · Difficulty 10.9746 · 6,038,725 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c0b187786d4a4d70c1ee76cdf205a27746738094954c0f7e46236f291a6acb14

Height

#787,419

Difficulty

10.974602

Transactions

4

Size

1.30 KB

Version

2

Bits

0af97f7e

Nonce

1,237,601,004

Timestamp

10/29/2014, 1:16:34 AM

Confirmations

6,038,725

Merkle Root

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

5.851 × 10⁹⁴(95-digit number)
58516690641926052959…49527018023308054599
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
5.851 × 10⁹⁴(95-digit number)
58516690641926052959…49527018023308054599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.170 × 10⁹⁵(96-digit number)
11703338128385210591…99054036046616109199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.340 × 10⁹⁵(96-digit number)
23406676256770421183…98108072093232218399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.681 × 10⁹⁵(96-digit number)
46813352513540842367…96216144186464436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.362 × 10⁹⁵(96-digit number)
93626705027081684734…92432288372928873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.872 × 10⁹⁶(97-digit number)
18725341005416336946…84864576745857747199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.745 × 10⁹⁶(97-digit number)
37450682010832673893…69729153491715494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.490 × 10⁹⁶(97-digit number)
74901364021665347787…39458306983430988799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.498 × 10⁹⁷(98-digit number)
14980272804333069557…78916613966861977599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.996 × 10⁹⁷(98-digit number)
29960545608666139115…57833227933723955199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.992 × 10⁹⁷(98-digit number)
59921091217332278230…15666455867447910399
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,853,277 XPM·at block #6,826,143 · 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