Block #568,626

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/30/2014, 1:18:39 PM · Difficulty 10.9650 · 6,239,468 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
193efe0ac456e63a9dc569995738e0ddbb768fe70a1009ca037e3e63bc07987a

Height

#568,626

Difficulty

10.965030

Transactions

3

Size

659 B

Version

2

Bits

0af70c39

Nonce

1,196,084,753

Timestamp

5/30/2014, 1:18:39 PM

Confirmations

6,239,468

Merkle Root

410d02729aaa529fc238e184ac602d5d995d0e134d80368258ba9699b4e2c389
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.350 × 10¹⁰⁰(101-digit number)
13507599848332907048…14512374929406484479
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.350 × 10¹⁰⁰(101-digit number)
13507599848332907048…14512374929406484479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.701 × 10¹⁰⁰(101-digit number)
27015199696665814096…29024749858812968959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.403 × 10¹⁰⁰(101-digit number)
54030399393331628193…58049499717625937919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.080 × 10¹⁰¹(102-digit number)
10806079878666325638…16098999435251875839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.161 × 10¹⁰¹(102-digit number)
21612159757332651277…32197998870503751679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.322 × 10¹⁰¹(102-digit number)
43224319514665302554…64395997741007503359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.644 × 10¹⁰¹(102-digit number)
86448639029330605109…28791995482015006719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.728 × 10¹⁰²(103-digit number)
17289727805866121021…57583990964030013439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.457 × 10¹⁰²(103-digit number)
34579455611732242043…15167981928060026879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.915 × 10¹⁰²(103-digit number)
69158911223464484087…30335963856120053759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.383 × 10¹⁰³(104-digit number)
13831782244692896817…60671927712240107519
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,708,798 XPM·at block #6,808,093 · 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