Block #293,758

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/4/2013, 12:12:38 PM · Difficulty 9.9907 · 6,524,249 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0bfcc3589acec1d01bb6bf53072c098b20ef9b5d62b28486cce3dbe5a780f909

Height

#293,758

Difficulty

9.990746

Transactions

2

Size

424 B

Version

2

Bits

09fda18d

Nonce

8,540

Timestamp

12/4/2013, 12:12:38 PM

Confirmations

6,524,249

Merkle Root

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

7.348 × 10⁹²(93-digit number)
73486201438655542608…60981373464760298199
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
7.348 × 10⁹²(93-digit number)
73486201438655542608…60981373464760298199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.469 × 10⁹³(94-digit number)
14697240287731108521…21962746929520596399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.939 × 10⁹³(94-digit number)
29394480575462217043…43925493859041192799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.878 × 10⁹³(94-digit number)
58788961150924434087…87850987718082385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.175 × 10⁹⁴(95-digit number)
11757792230184886817…75701975436164771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.351 × 10⁹⁴(95-digit number)
23515584460369773634…51403950872329542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.703 × 10⁹⁴(95-digit number)
47031168920739547269…02807901744659084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.406 × 10⁹⁴(95-digit number)
94062337841479094539…05615803489318169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.881 × 10⁹⁵(96-digit number)
18812467568295818907…11231606978636339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.762 × 10⁹⁵(96-digit number)
37624935136591637815…22463213957272678399
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,788,121 XPM·at block #6,818,006 · 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