Block #857,713

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2014, 1:03:56 AM · Difficulty 10.9675 · 5,967,593 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
219b4c6cc7b90dbfc7f701765a4c5de88b7fce51c4698c4539237bef75a60009

Height

#857,713

Difficulty

10.967477

Transactions

14

Size

3.66 KB

Version

2

Bits

0af7ac98

Nonce

649,408,539

Timestamp

12/18/2014, 1:03:56 AM

Confirmations

5,967,593

Merkle Root

9b5cb33dd72c80a0fbfa2f84bbfcf6f3af9dd7b1587ff29e71d8de2b8a88fdcc
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.446 × 10⁹⁵(96-digit number)
14462182696042806754…11099287566082697559
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.446 × 10⁹⁵(96-digit number)
14462182696042806754…11099287566082697559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.892 × 10⁹⁵(96-digit number)
28924365392085613508…22198575132165395119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.784 × 10⁹⁵(96-digit number)
57848730784171227016…44397150264330790239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.156 × 10⁹⁶(97-digit number)
11569746156834245403…88794300528661580479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.313 × 10⁹⁶(97-digit number)
23139492313668490806…77588601057323160959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.627 × 10⁹⁶(97-digit number)
46278984627336981612…55177202114646321919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.255 × 10⁹⁶(97-digit number)
92557969254673963225…10354404229292643839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.851 × 10⁹⁷(98-digit number)
18511593850934792645…20708808458585287679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.702 × 10⁹⁷(98-digit number)
37023187701869585290…41417616917170575359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.404 × 10⁹⁷(98-digit number)
74046375403739170580…82835233834341150719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.480 × 10⁹⁸(99-digit number)
14809275080747834116…65670467668682301439
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,846,550 XPM·at block #6,825,305 · 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