Block #3,260,825

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/10/2019, 2:33:11 AM · Difficulty 10.9960 · 3,545,883 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a06cea2e57ce6912348967b554c6df91a553344708f69bc440108a208cc23c10

Height

#3,260,825

Difficulty

10.996028

Transactions

3

Size

800 B

Version

2

Bits

0afefbb2

Nonce

67,223,989

Timestamp

7/10/2019, 2:33:11 AM

Confirmations

3,545,883

Merkle Root

6a77c796240626f43cd87739a2edaddf523e7dfa3e69c2c35db61d8fb2742f8a
Transactions (3)
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.509 × 10⁹⁵(96-digit number)
35091659288493172643…22731100948348405079
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.509 × 10⁹⁵(96-digit number)
35091659288493172643…22731100948348405079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.018 × 10⁹⁵(96-digit number)
70183318576986345287…45462201896696810159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.403 × 10⁹⁶(97-digit number)
14036663715397269057…90924403793393620319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.807 × 10⁹⁶(97-digit number)
28073327430794538114…81848807586787240639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.614 × 10⁹⁶(97-digit number)
56146654861589076229…63697615173574481279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.122 × 10⁹⁷(98-digit number)
11229330972317815245…27395230347148962559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.245 × 10⁹⁷(98-digit number)
22458661944635630491…54790460694297925119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.491 × 10⁹⁷(98-digit number)
44917323889271260983…09580921388595850239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.983 × 10⁹⁷(98-digit number)
89834647778542521967…19161842777191700479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.796 × 10⁹⁸(99-digit number)
17966929555708504393…38323685554383400959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.593 × 10⁹⁸(99-digit number)
35933859111417008787…76647371108766801919
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,697,761 XPM·at block #6,806,707 · 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