Block #565,983

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2014, 3:24:59 PM · Difficulty 10.9657 · 6,240,266 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
67e817c3a90ddee3a1a6c0be32c9446730d058ac9325f1d72223e538d4249a95

Height

#565,983

Difficulty

10.965699

Transactions

5

Size

1.38 KB

Version

2

Bits

0af73809

Nonce

17,777,277

Timestamp

5/28/2014, 3:24:59 PM

Confirmations

6,240,266

Merkle Root

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

2.952 × 10⁹⁹(100-digit number)
29521238488405145502…81211023863611351039
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
2.952 × 10⁹⁹(100-digit number)
29521238488405145502…81211023863611351039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.904 × 10⁹⁹(100-digit number)
59042476976810291005…62422047727222702079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.180 × 10¹⁰⁰(101-digit number)
11808495395362058201…24844095454445404159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.361 × 10¹⁰⁰(101-digit number)
23616990790724116402…49688190908890808319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.723 × 10¹⁰⁰(101-digit number)
47233981581448232804…99376381817781616639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.446 × 10¹⁰⁰(101-digit number)
94467963162896465608…98752763635563233279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.889 × 10¹⁰¹(102-digit number)
18893592632579293121…97505527271126466559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.778 × 10¹⁰¹(102-digit number)
37787185265158586243…95011054542252933119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.557 × 10¹⁰¹(102-digit number)
75574370530317172486…90022109084505866239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.511 × 10¹⁰²(103-digit number)
15114874106063434497…80044218169011732479
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,694,074 XPM·at block #6,806,248 · 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