Block #565,784

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2014, 12:20:35 PM · Difficulty 10.9656 · 6,241,345 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
45538c528a6b963dcbdde11a43c707dcd6942bb5e17d2943ad4d4575c3b9fd3f

Height

#565,784

Difficulty

10.965601

Transactions

6

Size

6.94 KB

Version

2

Bits

0af7319d

Nonce

43,036,884

Timestamp

5/28/2014, 12:20:35 PM

Confirmations

6,241,345

Merkle Root

2ad2cedf12e394f9c0f9c4062260699669f7510bc12908f8a782e065d79e9b54
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.859 × 10⁹⁷(98-digit number)
18592288706838015470…09732229075956706719
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.859 × 10⁹⁷(98-digit number)
18592288706838015470…09732229075956706719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.718 × 10⁹⁷(98-digit number)
37184577413676030941…19464458151913413439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.436 × 10⁹⁷(98-digit number)
74369154827352061882…38928916303826826879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.487 × 10⁹⁸(99-digit number)
14873830965470412376…77857832607653653759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.974 × 10⁹⁸(99-digit number)
29747661930940824752…55715665215307307519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.949 × 10⁹⁸(99-digit number)
59495323861881649505…11431330430614615039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.189 × 10⁹⁹(100-digit number)
11899064772376329901…22862660861229230079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.379 × 10⁹⁹(100-digit number)
23798129544752659802…45725321722458460159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.759 × 10⁹⁹(100-digit number)
47596259089505319604…91450643444916920319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.519 × 10⁹⁹(100-digit number)
95192518179010639209…82901286889833840639
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,701,136 XPM·at block #6,807,128 · 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