Block #1,706,195

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/7/2016, 7:27:25 AM · Difficulty 10.6476 · 5,119,251 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ac4a18feab5891629e1fcfa35ca8dc32b60c54622d64a4f743a8569526fcab52

Height

#1,706,195

Difficulty

10.647589

Transactions

15

Size

6.33 KB

Version

2

Bits

0aa5c866

Nonce

106,431,409

Timestamp

8/7/2016, 7:27:25 AM

Confirmations

5,119,251

Merkle Root

52cf175e8dcdbea1b71ee295f8781223c47e44b82991b998ab6183ffe2ba1c76
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.

3.640 × 10⁹⁴(95-digit number)
36404403271875425335…75327754298407304959
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
3.640 × 10⁹⁴(95-digit number)
36404403271875425335…75327754298407304959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.280 × 10⁹⁴(95-digit number)
72808806543750850670…50655508596814609919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.456 × 10⁹⁵(96-digit number)
14561761308750170134…01311017193629219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.912 × 10⁹⁵(96-digit number)
29123522617500340268…02622034387258439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.824 × 10⁹⁵(96-digit number)
58247045235000680536…05244068774516879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.164 × 10⁹⁶(97-digit number)
11649409047000136107…10488137549033758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.329 × 10⁹⁶(97-digit number)
23298818094000272214…20976275098067517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.659 × 10⁹⁶(97-digit number)
46597636188000544429…41952550196135034879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.319 × 10⁹⁶(97-digit number)
93195272376001088858…83905100392270069759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.863 × 10⁹⁷(98-digit number)
18639054475200217771…67810200784540139519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.727 × 10⁹⁷(98-digit number)
37278108950400435543…35620401569080279039
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,847,672 XPM·at block #6,825,445 · 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.
Privacy Policy·

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