Block #569,713

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/31/2014, 8:06:22 AM · Difficulty 10.9648 · 6,241,230 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
34ce9acd3b78702f67e71aff60123c33afa38b52c1730302551eb7b1245fa9dc

Height

#569,713

Difficulty

10.964780

Transactions

7

Size

1.96 KB

Version

2

Bits

0af6fbd7

Nonce

250,924,199

Timestamp

5/31/2014, 8:06:22 AM

Confirmations

6,241,230

Merkle Root

c9a81da158d5e693b99e3bbe329ad89becd5192f8b6a08e9c1f498681e29a685
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.164 × 10⁹⁹(100-digit number)
11641040729028004579…24567340787153015039
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.164 × 10⁹⁹(100-digit number)
11641040729028004579…24567340787153015039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.328 × 10⁹⁹(100-digit number)
23282081458056009158…49134681574306030079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.656 × 10⁹⁹(100-digit number)
46564162916112018316…98269363148612060159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.312 × 10⁹⁹(100-digit number)
93128325832224036633…96538726297224120319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.862 × 10¹⁰⁰(101-digit number)
18625665166444807326…93077452594448240639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.725 × 10¹⁰⁰(101-digit number)
37251330332889614653…86154905188896481279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.450 × 10¹⁰⁰(101-digit number)
74502660665779229306…72309810377792962559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.490 × 10¹⁰¹(102-digit number)
14900532133155845861…44619620755585925119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.980 × 10¹⁰¹(102-digit number)
29801064266311691722…89239241511171850239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.960 × 10¹⁰¹(102-digit number)
59602128532623383445…78478483022343700479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.192 × 10¹⁰²(103-digit number)
11920425706524676689…56956966044687400959
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,731,641 XPM·at block #6,810,942 · 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