Block #1,579,507

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2016, 12:45:20 AM · Difficulty 10.6715 · 5,247,856 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f0cd900a3969a3a4534c619470372dc1f0a1d36b3e2f8df7680636672dff91f7

Height

#1,579,507

Difficulty

10.671508

Transactions

2

Size

428 B

Version

2

Bits

0aabe7f5

Nonce

423,473,397

Timestamp

5/11/2016, 12:45:20 AM

Confirmations

5,247,856

Merkle Root

029101a09eef68790f18ea45a9952de427ac46e2a906a414687ea206294be5d3
Transactions (2)
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.

6.571 × 10⁹⁶(97-digit number)
65718319160081013783…40530839490251888639
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
6.571 × 10⁹⁶(97-digit number)
65718319160081013783…40530839490251888639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.314 × 10⁹⁷(98-digit number)
13143663832016202756…81061678980503777279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.628 × 10⁹⁷(98-digit number)
26287327664032405513…62123357961007554559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.257 × 10⁹⁷(98-digit number)
52574655328064811026…24246715922015109119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.051 × 10⁹⁸(99-digit number)
10514931065612962205…48493431844030218239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.102 × 10⁹⁸(99-digit number)
21029862131225924410…96986863688060436479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.205 × 10⁹⁸(99-digit number)
42059724262451848821…93973727376120872959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.411 × 10⁹⁸(99-digit number)
84119448524903697642…87947454752241745919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.682 × 10⁹⁹(100-digit number)
16823889704980739528…75894909504483491839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.364 × 10⁹⁹(100-digit number)
33647779409961479057…51789819008966983679
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,863,004 XPM·at block #6,827,362 · 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