Block #1,162,697

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/20/2015, 2:54:05 PM · Difficulty 10.9354 · 5,653,905 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
db23f02980a1bee47bc2e39a234e57c05bfc59e479cfee71ad51c5bf3544a2b5

Height

#1,162,697

Difficulty

10.935360

Transactions

2

Size

1.42 KB

Version

2

Bits

0aef73c4

Nonce

844,170,561

Timestamp

7/20/2015, 2:54:05 PM

Confirmations

5,653,905

Merkle Root

8b99b607a0f116f3e9ab6b3bd08ffb50af8d528cc72eab327f4df0f832822cbb
Transactions (2)
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.

8.349 × 10⁹⁴(95-digit number)
83492639578546203434…57839058011980230399
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
8.349 × 10⁹⁴(95-digit number)
83492639578546203434…57839058011980230399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.669 × 10⁹⁵(96-digit number)
16698527915709240686…15678116023960460799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.339 × 10⁹⁵(96-digit number)
33397055831418481373…31356232047920921599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.679 × 10⁹⁵(96-digit number)
66794111662836962747…62712464095841843199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.335 × 10⁹⁶(97-digit number)
13358822332567392549…25424928191683686399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.671 × 10⁹⁶(97-digit number)
26717644665134785099…50849856383367372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.343 × 10⁹⁶(97-digit number)
53435289330269570198…01699712766734745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.068 × 10⁹⁷(98-digit number)
10687057866053914039…03399425533469491199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.137 × 10⁹⁷(98-digit number)
21374115732107828079…06798851066938982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.274 × 10⁹⁷(98-digit number)
42748231464215656158…13597702133877964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.549 × 10⁹⁷(98-digit number)
85496462928431312317…27195404267755929599
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,776,942 XPM·at block #6,816,601 · 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