Block #112,930

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/12/2013, 6:22:20 AM · Difficulty 9.7272 · 6,697,010 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
75d1f9dff11116fb6e97e176f293412b56e572ad2b6f01cdc880336114f4048e

Height

#112,930

Difficulty

9.727238

Transactions

7

Size

2.03 KB

Version

2

Bits

09ba2c3f

Nonce

259

Timestamp

8/12/2013, 6:22:20 AM

Confirmations

6,697,010

Merkle Root

b1abc6a75516d76ba3e729f41bfa537ce40ffa2489064b29b26a961ee0253a12
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.

2.247 × 10¹⁰¹(102-digit number)
22473484428782912839…47695134718970319399
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
2.247 × 10¹⁰¹(102-digit number)
22473484428782912839…47695134718970319399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.494 × 10¹⁰¹(102-digit number)
44946968857565825678…95390269437940638799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.989 × 10¹⁰¹(102-digit number)
89893937715131651357…90780538875881277599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.797 × 10¹⁰²(103-digit number)
17978787543026330271…81561077751762555199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.595 × 10¹⁰²(103-digit number)
35957575086052660542…63122155503525110399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.191 × 10¹⁰²(103-digit number)
71915150172105321085…26244311007050220799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.438 × 10¹⁰³(104-digit number)
14383030034421064217…52488622014100441599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.876 × 10¹⁰³(104-digit number)
28766060068842128434…04977244028200883199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.753 × 10¹⁰³(104-digit number)
57532120137684256868…09954488056401766399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.150 × 10¹⁰⁴(105-digit number)
11506424027536851373…19908976112803532799
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,723,608 XPM·at block #6,809,939 · 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