mtproto 0.0.29 → 0.0.31

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 0a50a3572643e17c2435e3b310979e9a9ddbbf498bf8febb5819d96a73443899
-  data.tar.gz: 622d75782346d1cf190e3daa6097305afc3520b5fe5834b727a79bf4c0e86b36
+  metadata.gz: 7dc46e6630ceabe739c317ee739b3b23a62e60fec9164fcce46549570c2ae440
+  data.tar.gz: 99cfdf36c0bb6101dd1d5389ec28c81616c02ec5303ba3200cfa6caa960fe77d
 SHA512:
-  metadata.gz: 7ec7ee0beac3ee1143720d8e4972dba6a6f7db379069b0cc2a3274b5c81becb8e1353f448654b4c6c9d0385472d4985725292da56c040a50476ec94d2f980a93
-  data.tar.gz: c0951ce0991d6c960f6963647849156333bf5bebe4d59b0857af6703707430249c54bc4805be7b8e2527df84141f68dce9c43e6668ca5200eb4f4b7f3d146d4c
+  metadata.gz: 8bbbf72972ce201874a7980453d776d7de4b99aa34918eb6ddee300c35cdbacda900b9a2ecf4a34faf916666fc8c98e0194e8830c58300804d98be5e5eedef27
+  data.tar.gz: 314835babb0a97abc5e3f75bf0f7b231d08b91c8b32d5862985f70e33edf89e39663c48bf84c74c9931e5675989f00e7b1cb2edb3a48878690afe4e790dbd4d3

data/ext/factorization/factorization.c

@@ -1,11 +1,46 @@
 #include <ruby.h>
 #include <stdint.h>
-#include <math.h>
 
 static VALUE mMTProto;
 static VALUE mCrypto;
 static VALUE mFactorization;
 
+static uint64_t
+mulmod(uint64_t a, uint64_t b, uint64_t m)
+{
+    return (uint64_t)(((__uint128_t)a * b) % m);
+}
+
+static uint64_t
+gcd64(uint64_t a, uint64_t b)
+{
+    while (b) {
+        uint64_t t = a % b;
+        a = b;
+        b = t;
+    }
+    return a;
+}
+
+/* Pollard's rho with f(x) = x^2 + c (mod n). Returns a non-trivial factor, or n
+ * on failure (cycle with no factor) so the caller can retry with another c. The
+ * MTProto pq is a product of two ~31-bit primes, so this finds a factor in a
+ * few thousand steps rather than the ~2^31 of trial division. */
+static uint64_t
+pollard_rho(uint64_t n, uint64_t c)
+{
+    uint64_t x = 2, y = 2, d = 1;
+    while (d == 1) {
+        x = (mulmod(x, x, n) + c) % n;
+        y = (mulmod(y, y, n) + c) % n;
+        y = (mulmod(y, y, n) + c) % n;
+        uint64_t diff = x > y ? x - y : y - x;
+        if (diff == 0) return n;
+        d = gcd64(diff, n);
+    }
+    return d;
+}
+
 static VALUE
 factorize_pq(VALUE self, VALUE pq_bytes)
 {
@@ -23,33 +58,32 @@ factorize_pq(VALUE self, VALUE pq_bytes)
         rb_raise(rb_eArgError, "Number must be > 3");
     }
 
+    uint64_t p;
     if (n % 2 == 0) {
-        VALUE result = rb_ary_new2(2);
-        rb_ary_push(result, ULL2NUM(2));
-        rb_ary_push(result, ULL2NUM(n / 2));
-        return result;
+        p = 2;
+    } else {
+        uint64_t d = n;
+        for (uint64_t c = 1; c < 256; c++) {
+            d = pollard_rho(n, c);
+            if (d != n && d > 1) break;
+        }
+        if (d == n || d <= 1) {
+            rb_raise(rb_eRuntimeError, "No non-trivial factors found (n might be prime)");
+        }
+        p = d;
     }
 
-    uint64_t limit = (uint64_t)sqrt((double)n) + 1;
-    for (uint64_t i = 3; i < limit; i += 2) {
-        if (n % i == 0) {
-            uint64_t p = i;
-            uint64_t q = n / i;
-
-            if (p > q) {
-                uint64_t tmp = p;
-                p = q;
-                q = tmp;
-            }
-
-            VALUE result = rb_ary_new2(2);
-            rb_ary_push(result, ULL2NUM(p));
-            rb_ary_push(result, ULL2NUM(q));
-            return result;
-        }
+    uint64_t q = n / p;
+    if (p > q) {
+        uint64_t tmp = p;
+        p = q;
+        q = tmp;
     }
 
-    rb_raise(rb_eRuntimeError, "No non-trivial factors found (n might be prime)");
+    VALUE result = rb_ary_new2(2);
+    rb_ary_push(result, ULL2NUM(p));
+    rb_ary_push(result, ULL2NUM(q));
+    return result;
 }
 
 void Init_factorization(void)

data/lib/mtproto/client/api/export_bot_token.rb

@@ -0,0 +1,14 @@
+# frozen_string_literal: true
+
+require_relative '../../tl/objects/export_bot_token'
+require_relative '../../tl/objects/exported_bot_token'
+
+module MTProto
+  class Client
+    class API
+      def export_bot_token(bot:, revoke: false)
+        rpc_call(TL::ExportBotToken.new(bot: bot, revoke: revoke), TL::ExportedBotToken).body.token
+      end
+    end
+  end
+end

data/lib/mtproto/client/api/send_message.rb

@@ -17,12 +17,13 @@ module MTProto
       # A `reply_to` (with optional `quote_text`/`quote_offset`) replies to a message,
       # optionally pinning the quoted fragment.
       def send_message(peer:, message: '', random_id: nil, reply_to: nil, entities: nil,
-                       parse_mode: nil, rich_markdown: nil, quote_text: nil, quote_offset: nil, no_webpage: false)
+                       parse_mode: nil, rich_markdown: nil, quote_text: nil, quote_offset: nil, no_webpage: false,
+                       reply_markup: nil)
         message, entities = Markdown.parse(message) if parse_mode && entities.nil? && rich_markdown.nil?
         rpc_call(
           TL::SendMessage.new(peer: peer, message: message, random_id: random_id, reply_to: reply_to,
             entities: entities, rich_markdown: rich_markdown, quote_text: quote_text, quote_offset: quote_offset,
-            no_webpage: no_webpage),
+            no_webpage: no_webpage, reply_markup: reply_markup),
           TL::UpdateShortSentMessage
         ).body
       end

data/lib/mtproto/client/api.rb

@@ -18,6 +18,7 @@ require_relative 'api/get_bot_callback_answer'
 require_relative 'api/send_message'
 require_relative 'api/set_typing'
 require_relative 'api/get_contacts'
+require_relative 'api/export_bot_token'
 require_relative 'api/pin_message'
 require_relative 'api/unpin_all_messages'
 require_relative 'api/get_pinned_messages'

data/lib/mtproto/tl/objects/updates_difference.rb

@@ -8,12 +8,12 @@ require_relative 'updates'
 module MTProto
   module TL
     class UpdatesDifference
-      attr_reader :type, :date, :seq, :new_messages, :pts, :state, :chats, :users, :guest_queries
+      attr_reader :type, :date, :seq, :new_messages, :pts, :state, :chats, :users, :guest_queries, :managed_bots
 
       SCHEMA_PATH = File.expand_path('../../../../data/tl-schema.json', __dir__)
 
       def initialize(type:, date: nil, seq: nil, new_messages: [], pts: nil, state: nil, chats: [], users: [],
-                     guest_queries: [])
+                     guest_queries: [], managed_bots: [])
         @type = type
         @date = date
         @seq = seq
@@ -23,6 +23,7 @@ module MTProto
         @chats = chats
         @users = users
         @guest_queries = guest_queries
+        @managed_bots = managed_bots
       end
 
       def self.schema
@@ -47,6 +48,7 @@ module MTProto
 
       UPDATE_NEW_MESSAGE = 0x1f2b0afd
       UPDATE_NEW_CHANNEL_MESSAGE = 0x62ba04d9
+      UPDATE_MANAGED_BOT = 0x4880ed9a
 
       class << self
         private
@@ -68,7 +70,7 @@ module MTProto
 
           messages, offset = parse_messages_vector(data, offset)
           offset = schema.skip_vector(data, offset) # new_encrypted_messages
-          other_messages, guest_queries, offset = parse_other_updates(data, offset)
+          other_messages, guest_queries, managed_bots, offset = parse_other_updates(data, offset)
           chats, offset = Dialogs.chats_at(data, offset)
           users, offset = Dialogs.users_at(data, offset)
           state = UpdatesState.deserialize(data[offset..])
@@ -77,6 +79,7 @@ module MTProto
             type: constructor == Constructors::UPDATES_DIFFERENCE ? :difference : :slice,
             new_messages: messages + other_messages,
             guest_queries: guest_queries,
+            managed_bots: managed_bots,
             chats: chats, users: users, state: state
           )
         end
@@ -91,6 +94,7 @@ module MTProto
 
           messages = []
           guest_queries = []
+          managed_bots = []
           count.times do
             ctor = data[offset, 4].unpack1('L<')
             if [UPDATE_NEW_MESSAGE, UPDATE_NEW_CHANNEL_MESSAGE].include?(ctor)
@@ -99,10 +103,12 @@ module MTProto
               messages << msg.to_h if msg
             elsif ctor == Updates::UPDATE_BOT_GUEST_CHAT_QUERY
               guest_queries << Updates.extract_guest_query(data, offset)
+            elsif ctor == UPDATE_MANAGED_BOT
+              managed_bots << { user_id: data[offset + 4, 8].unpack1('Q<'), bot_id: data[offset + 12, 8].unpack1('Q<') }
             end
             offset = schema.skip(data, offset)
           end
-          [messages, guest_queries, offset]
+          [messages, guest_queries, managed_bots, offset]
         end
 
         def parse_messages_vector(data, offset)

data/lib/mtproto/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module MTProto
-  VERSION = '0.0.29'
+  VERSION = '0.0.31'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: mtproto
 version: !ruby/object:Gem::Version
-  version: 0.0.29
+  version: 0.0.31
 platform: ruby
 authors:
 - Artem Levenkov
@@ -65,6 +65,7 @@ files:
 - lib/mtproto/client/api.rb
 - lib/mtproto/client/api/check_password.rb
 - lib/mtproto/client/api/export_authorization.rb
+- lib/mtproto/client/api/export_bot_token.rb
 - lib/mtproto/client/api/export_login_token.rb
 - lib/mtproto/client/api/get_bot_callback_answer.rb
 - lib/mtproto/client/api/get_channel_difference.rb