Block #638,900

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/18/2014, 10:56:37 PM · Difficulty 10.9605 · 6,170,281 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f44afdd51fe9fbcf231d603c8fa9d92a1d02f90958fbc68312eee1ea21bff53f

Height

#638,900

Difficulty

10.960469

Transactions

6

Size

1.74 KB

Version

2

Bits

0af5e14a

Nonce

1,889,277,646

Timestamp

7/18/2014, 10:56:37 PM

Confirmations

6,170,281

Merkle Root

8b58e5e3ba0430423af2c60d1c0b420b7686c4406c0910fefd8e1ba8f09c6549
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.

4.138 × 10⁹⁴(95-digit number)
41385100141723809750…04979447374579562119
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
4.138 × 10⁹⁴(95-digit number)
41385100141723809750…04979447374579562119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.277 × 10⁹⁴(95-digit number)
82770200283447619500…09958894749159124239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.655 × 10⁹⁵(96-digit number)
16554040056689523900…19917789498318248479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.310 × 10⁹⁵(96-digit number)
33108080113379047800…39835578996636496959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.621 × 10⁹⁵(96-digit number)
66216160226758095600…79671157993272993919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.324 × 10⁹⁶(97-digit number)
13243232045351619120…59342315986545987839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.648 × 10⁹⁶(97-digit number)
26486464090703238240…18684631973091975679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.297 × 10⁹⁶(97-digit number)
52972928181406476480…37369263946183951359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.059 × 10⁹⁷(98-digit number)
10594585636281295296…74738527892367902719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.118 × 10⁹⁷(98-digit number)
21189171272562590592…49477055784735805439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.237 × 10⁹⁷(98-digit number)
42378342545125181184…98954111569471610879
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,717,512 XPM·at block #6,809,180 · 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.

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