Block #274,014

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/26/2013, 2:40:14 AM · Difficulty 9.9562 · 6,534,101 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4cf89531c6f7623b0a70f9f24f9e8bee404e0d05010935037aafb5e1e15abc3e

Height

#274,014

Difficulty

9.956160

Transactions

8

Size

3.36 KB

Version

2

Bits

09f4c6eb

Nonce

6,579

Timestamp

11/26/2013, 2:40:14 AM

Confirmations

6,534,101

Merkle Root

ec59d1d3f5d4c6f47d7dcd24410567cb58eba52e8090cc0ac119e43662d77453
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.977 × 10¹⁰²(103-digit number)
89775201212042880500…05769261396366089749
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.977 × 10¹⁰²(103-digit number)
89775201212042880500…05769261396366089749
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.795 × 10¹⁰³(104-digit number)
17955040242408576100…11538522792732179499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.591 × 10¹⁰³(104-digit number)
35910080484817152200…23077045585464358999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.182 × 10¹⁰³(104-digit number)
71820160969634304400…46154091170928717999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.436 × 10¹⁰⁴(105-digit number)
14364032193926860880…92308182341857435999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.872 × 10¹⁰⁴(105-digit number)
28728064387853721760…84616364683714871999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.745 × 10¹⁰⁴(105-digit number)
57456128775707443520…69232729367429743999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.149 × 10¹⁰⁵(106-digit number)
11491225755141488704…38465458734859487999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.298 × 10¹⁰⁵(106-digit number)
22982451510282977408…76930917469718975999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.596 × 10¹⁰⁵(106-digit number)
45964903020565954816…53861834939437951999
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,708,968 XPM·at block #6,808,114 · 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