emc2foundation / mil Goto Github PK

Milevium (MIL) source tree

Home Page: https://www.emc2.foundation/mil

License: MIT License

Shell 0.67% M4 2.59% QMake 0.03% Roff 0.43% Makefile 1.49% Python 13.95% C++ 66.62% C 12.15% HTML 0.71% CSS 0.02% Objective-C++ 0.10% Sage 0.42% Assembly 0.40% Java 0.42%

mil's People

Watchers

Forkers

barrystyle deckersu ca333 komodoplatform vladandev milicasta aglucaci who-biz thecomputergenie

mil's Issues

dPoW hardfork pubkey update

The KMD hardfork update for season 7 has been released 🎉 and is scheduled for the 30th of June.
Your will need to update the MIL code to include the new pubkeys and calculate an estimated MIL block height that corresponds to close to the same date / time.

You can reference this pull request to get the required changes KomodoPlatform/AYAv2#5

Mining section of mil-cli help text does not display properly

When sending the command help to mil-cli, the mining section appears to have some faulty code:

JSON value is not a string as expected
JSON value is not a string as expected
JSON value is not a string as expected
getblocktemplate ( TemplateRequest )
getmininginfo
getnetworkhashps ( blocks height )
prioritisetransaction <txid> <priority delta> <fee delta>
submitblock "hexdata" ( "jsonparametersobject" )

Note the JSON value is not a string as expected lines (x3)

compile on debian 12 fails

  CXX      libbitcoin_server_a-torcontrol.o
In file included from /usr/include/c++/12/map:60,
                 from serialize.h:15,
                 from amount.h:9,
                 from main.h:14:
/usr/include/c++/12/bits/stl_tree.h: In instantiation of ‘static const _Key& std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_S_key(_Const_Link_type) [with _Key = std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >; _Val = std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >; _KeyOfValue = std::_Identity<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >; _Compare = IteratorComparator; _Alloc = std::allocator<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >; _Const_Link_type = const std::_Rb_tree_node<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >*]’:
/usr/include/c++/12/bits/stl_tree.h:2117:47:   required from ‘std::pair<std::_Rb_tree_node_base*, std::_Rb_tree_node_base*> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_unique_pos(const key_type&) [with _Key = std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >; _Val = std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >; _KeyOfValue = std::_Identity<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >; _Compare = IteratorComparator; _Alloc = std::allocator<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >; key_type = std::_Rb_tree<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >, std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >, std::_Identity<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >, IteratorComparator, std::allocator<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > > >::key_type]’
/usr/include/c++/12/bits/stl_tree.h:2170:4:   required from ‘std::pair<std::_Rb_tree_iterator<_Val>, bool> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique(_Arg&&) [with _Arg = const std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >&; _Key = std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >; _Val = std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >; _KeyOfValue = std::_Identity<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >; _Compare = IteratorComparator; _Alloc = std::allocator<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >]’
/usr/include/c++/12/bits/stl_set.h:512:25:   required from ‘std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >; _Compare = IteratorComparator; _Alloc = std::allocator<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >, std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >, std::_Identity<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >, IteratorComparator, std::allocator<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > > >::const_iterator; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other = std::allocator<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key> = __gnu_cxx::__alloc_traits<std::allocator<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >, std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >::rebind<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >; typename _Alloc::value_type = std::allocator<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> > >::value_type; value_type = std::set<std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >, IteratorComparator>::value_type]’
main.cpp:739:57:   required from here
/usr/include/c++/12/bits/stl_tree.h:770:15: error: static assertion failed: comparison object must be invocable as const
  770 |               is_invocable_v<const _Compare&, const _Key&, const _Key&>,
      |               ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_tree.h:770:15: note: ‘std::is_invocable_v<const IteratorComparator&, const std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >&, const std::_Rb_tree_iterator<std::pair<const uint256, COrphanTx> >&>’ evaluates to false

`getrawtransaction` shows wrong value in `blockhash`

blockhash in getrawtransaction should contain the blockhash, not the height:

mil-cli getrawtransaction 556c4f2824e644722b19de075c1a955abf00e4ed8f0659c99ff320044695568d 1
{
  "hex": "01000000013cfffacc93c451c46073311f824787c8b7705ebebccb876f2bc6b63e73960aa1010000006a4730440220668b79164aa61a642bb6ce62e3bde3a917c9a3141cfd01dcd0af6b47b280877d02201b5e96e8a964f6af57e83cee1b8b817bc1e1d13e53ca9638191ee736032083780121031bb83b58ec130e28e0a6d5d2acf2eb01b0d3f1670e021d47d31db8a858219da8ffffffff03809698000000000017a9145c97db69178f1b76ac9b1251cbec2b9d8cea6295870000000000000000166a141cc5aadd7bf47d43d5951c6871f7ccfd7f8a9e0ce0896a02000000001976a914c3f710deb7320b0efa6edb14e3ebeeb9155fa90d88ac641d2b64",
  "txid": "556c4f2824e644722b19de075c1a955abf00e4ed8f0659c99ff320044695568d",
  "hash": "556c4f2824e644722b19de075c1a955abf00e4ed8f0659c99ff320044695568d",
  "size": 254,
  "vsize": 254,
  "version": 1,
  "locktime": 1680547172,
  "vin": [
    {
      "txid": "a10a96733eb6c62b6f87cbbcbe5e70b7c88747821f317360c451c493ccfaff3c",
      "vout": 1,
      "scriptSig": {
        "asm": "30440220668b79164aa61a642bb6ce62e3bde3a917c9a3141cfd01dcd0af6b47b280877d02201b5e96e8a964f6af57e83cee1b8b817bc1e1d13e53ca9638191ee73603208378[ALL] 031bb83b58ec130e28e0a6d5d2acf2eb01b0d3f1670e021d47d31db8a858219da8",
        "hex": "4730440220668b79164aa61a642bb6ce62e3bde3a917c9a3141cfd01dcd0af6b47b280877d02201b5e96e8a964f6af57e83cee1b8b817bc1e1d13e53ca9638191ee736032083780121031bb83b58ec130e28e0a6d5d2acf2eb01b0d3f1670e021d47d31db8a858219da8"
      },
      "sequence": 4294967295
    }
  ],
  "vout": [
    {
      "value": 0.10000000,
      "ValueSat": 10000000,
      "n": 0,
      "scriptPubKey": {
        "asm": "OP_HASH160 5c97db69178f1b76ac9b1251cbec2b9d8cea6295 OP_EQUAL",
        "hex": "a9145c97db69178f1b76ac9b1251cbec2b9d8cea629587",
        "reqSigs": 1,
        "type": "scripthash",
        "addresses": [
          "LTfYM5M9jd37RaxvSGTv12WNvYRjQ68RtT"
        ]
      }
    }, 
    {
      "value": 0.00000000,
      "ValueSat": 0,
      "n": 1,
      "scriptPubKey": {
        "asm": "OP_RETURN 1cc5aadd7bf47d43d5951c6871f7ccfd7f8a9e0c",
        "hex": "6a141cc5aadd7bf47d43d5951c6871f7ccfd7f8a9e0c",
        "type": "nulldata"
      }
    }, 
    {
      "value": 0.40536544,
      "ValueSat": 40536544,
      "n": 2,
      "scriptPubKey": {
        "asm": "OP_DUP OP_HASH160 c3f710deb7320b0efa6edb14e3ebeeb9155fa90d OP_EQUALVERIFY OP_CHECKSIG",
        "hex": "76a914c3f710deb7320b0efa6edb14e3ebeeb9155fa90d88ac",
        "reqSigs": 1,
        "type": "pubkeyhash",
        "addresses": [
          "MRmKyH12X2txLoCh6XSLLY8zUzEEfR8bsE"
        ]
      }
    }
  ],
  "blockhash": 558195,
  "height": 558195,
  "confirmations": 6,
  "time": 1680547179,
  "blocktime": 1680547179
}

Recommend Projects

React

A declarative, efficient, and flexible JavaScript library for building user interfaces.
Vue.js

🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
Typescript

TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
TensorFlow

An Open Source Machine Learning Framework for Everyone
Django

The Web framework for perfectionists with deadlines.
Laravel

A PHP framework for web artisans
D3

Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

javascript

JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
web

Some thing interesting about web. New door for the world.
server

A server is a program made to process requests and deliver data to clients.
Machine learning

Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Visualization

Some thing interesting about visualization, use data art
Game

Some thing interesting about game, make everyone happy.

Recommend Org

Facebook

We are working to build community through open source technology. NB: members must have two-factor auth.
Microsoft

Open source projects and samples from Microsoft.
Google

Google ❤️ Open Source for everyone.
Alibaba

Alibaba Open Source for everyone
D3

Data-Driven Documents codes.
Tencent

China tencent open source team.