Block #767,070

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/14/2014, 4:19:48 AM · Difficulty 10.9788 · 6,043,185 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8e1c13454b4399b50200a116da91ee005a4c4e8b3cb8acbcd0fb651f3654ec85

Height

#767,070

Difficulty

10.978825

Transactions

3

Size

1.08 KB

Version

2

Bits

0afa9444

Nonce

6,000

Timestamp

10/14/2014, 4:19:48 AM

Confirmations

6,043,185

Merkle Root

3cc1349a6ca2256964ca560527d81a2b18a66d31789f589ffa47d3c05911d0dd
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.711 × 10¹⁰¹(102-digit number)
17112009047103901538…29345951842369993599
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.711 × 10¹⁰¹(102-digit number)
17112009047103901538…29345951842369993599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.422 × 10¹⁰¹(102-digit number)
34224018094207803077…58691903684739987199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.844 × 10¹⁰¹(102-digit number)
68448036188415606154…17383807369479974399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.368 × 10¹⁰²(103-digit number)
13689607237683121230…34767614738959948799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.737 × 10¹⁰²(103-digit number)
27379214475366242461…69535229477919897599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.475 × 10¹⁰²(103-digit number)
54758428950732484923…39070458955839795199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.095 × 10¹⁰³(104-digit number)
10951685790146496984…78140917911679590399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.190 × 10¹⁰³(104-digit number)
21903371580292993969…56281835823359180799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.380 × 10¹⁰³(104-digit number)
43806743160585987938…12563671646718361599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.761 × 10¹⁰³(104-digit number)
87613486321171975877…25127343293436723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.752 × 10¹⁰⁴(105-digit number)
17522697264234395175…50254686586873446399
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,726,113 XPM·at block #6,810,254 · 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