Block #566,841

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/29/2014, 5:10:23 AM · Difficulty 10.9660 · 6,242,029 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4fcd977e6d7ea937dc7aa0a1aba6fd600f0f3f549df38e95d1df061dd100982b

Height

#566,841

Difficulty

10.965972

Transactions

1

Size

731 B

Version

2

Bits

0af749f4

Nonce

1,441,403

Timestamp

5/29/2014, 5:10:23 AM

Confirmations

6,242,029

Merkle Root

0cbbd1ce58e5e4b9111eed96efe941305836cea33c16c7b4770bae02d2aebe5a
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.629 × 10⁹⁵(96-digit number)
26293110797334964161…53477946237511445759
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.629 × 10⁹⁵(96-digit number)
26293110797334964161…53477946237511445759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.258 × 10⁹⁵(96-digit number)
52586221594669928323…06955892475022891519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.051 × 10⁹⁶(97-digit number)
10517244318933985664…13911784950045783039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.103 × 10⁹⁶(97-digit number)
21034488637867971329…27823569900091566079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.206 × 10⁹⁶(97-digit number)
42068977275735942658…55647139800183132159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.413 × 10⁹⁶(97-digit number)
84137954551471885317…11294279600366264319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.682 × 10⁹⁷(98-digit number)
16827590910294377063…22588559200732528639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.365 × 10⁹⁷(98-digit number)
33655181820588754127…45177118401465057279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.731 × 10⁹⁷(98-digit number)
67310363641177508254…90354236802930114559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.346 × 10⁹⁸(99-digit number)
13462072728235501650…80708473605860229119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.692 × 10⁹⁸(99-digit number)
26924145456471003301…61416947211720458239
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,715,010 XPM·at block #6,808,869 · 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